./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.h_Ibuf.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 f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:13:51,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:13:51,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:13:51,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:13:51,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:13:51,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:13:51,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:13:51,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:13:51,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:13:51,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:13:51,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:13:51,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:13:51,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:13:51,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:13:51,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:13:51,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:13:51,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:13:51,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:13:51,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:13:51,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:13:51,175 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 -> f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 [2025-02-05 19:13:51,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:13:51,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:13:51,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:13:51,409 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:13:51,409 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:13:51,410 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.h_Ibuf.c [2025-02-05 19:13:52,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eeda39cd6/bcaa32212ddf4d0899a93c81a931b05d/FLAG8aa32b879 [2025-02-05 19:13:53,105 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:13:53,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c [2025-02-05 19:13:53,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eeda39cd6/bcaa32212ddf4d0899a93c81a931b05d/FLAG8aa32b879 [2025-02-05 19:13:53,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eeda39cd6/bcaa32212ddf4d0899a93c81a931b05d [2025-02-05 19:13:53,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:13:53,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:13:53,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:13:53,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:13:53,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:13:53,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8cb29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53, skipping insertion in model container [2025-02-05 19:13:53,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:13:53,280 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.h_Ibuf.c[1246,1259] [2025-02-05 19:13:53,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:13:53,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:13:53,429 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.h_Ibuf.c[1246,1259] [2025-02-05 19:13:53,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:13:53,521 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:13:53,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53 WrapperNode [2025-02-05 19:13:53,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:13:53,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:13:53,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:13:53,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:13:53,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,657 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1465 [2025-02-05 19:13:53,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:13:53,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:13:53,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:13:53,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:13:53,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,746 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-05 19:13:53,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:13:53,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:13:53,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:13:53,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:13:53,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (1/1) ... [2025-02-05 19:13:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:13:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:13:53,905 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-05 19:13:53,915 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-05 19:13:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:13:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:13:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:13:53,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:13:54,189 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:13:54,190 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:13:55,526 INFO L? ?]: Removed 912 outVars from TransFormulas that were not future-live. [2025-02-05 19:13:55,526 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:13:55,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:13:55,616 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:13:55,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:13:55 BoogieIcfgContainer [2025-02-05 19:13:55,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:13:55,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:13:55,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:13:55,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:13:55,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:13:53" (1/3) ... [2025-02-05 19:13:55,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bb54da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:13:55, skipping insertion in model container [2025-02-05 19:13:55,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:53" (2/3) ... [2025-02-05 19:13:55,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bb54da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:13:55, skipping insertion in model container [2025-02-05 19:13:55,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:13:55" (3/3) ... [2025-02-05 19:13:55,625 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Ibuf.c [2025-02-05 19:13:55,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:13:55,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Ibuf.c that has 1 procedures, 482 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:13:55,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:13:55,697 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;@3c32474f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:13:55,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:13:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 482 states, 480 states have (on average 1.4979166666666666) internal successors, (719), 481 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 19:13:55,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:55,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:55,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:55,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -458391249, now seen corresponding path program 1 times [2025-02-05 19:13:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399752284] [2025-02-05 19:13:55,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 19:13:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 19:13:55,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399752284] [2025-02-05 19:13:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399752284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:56,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:56,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:13:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574412757] [2025-02-05 19:13:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:13:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:56,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:13:56,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:13:56,150 INFO L87 Difference]: Start difference. First operand has 482 states, 480 states have (on average 1.4979166666666666) internal successors, (719), 481 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:13:56,528 INFO L93 Difference]: Finished difference Result 953 states and 1425 transitions. [2025-02-05 19:13:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:13:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 19:13:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:13:56,540 INFO L225 Difference]: With dead ends: 953 [2025-02-05 19:13:56,540 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 19:13:56,546 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-05 19:13:56,548 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:13:56,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1780 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:13:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 19:13:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-02-05 19:13:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.49375) internal successors, (717), 480 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 717 transitions. [2025-02-05 19:13:56,584 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 717 transitions. Word has length 21 [2025-02-05 19:13:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:13:56,584 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 717 transitions. [2025-02-05 19:13:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 717 transitions. [2025-02-05 19:13:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 19:13:56,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:56,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:13:56,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:56,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1320546916, now seen corresponding path program 1 times [2025-02-05 19:13:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811487154] [2025-02-05 19:13:56,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:56,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 19:13:56,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 19:13:56,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:56,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811487154] [2025-02-05 19:13:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811487154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:13:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976297500] [2025-02-05 19:13:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:13:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:56,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:13:56,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:13:56,800 INFO L87 Difference]: Start difference. First operand 481 states and 717 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:13:57,092 INFO L93 Difference]: Finished difference Result 954 states and 1423 transitions. [2025-02-05 19:13:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:13:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 19:13:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:13:57,094 INFO L225 Difference]: With dead ends: 954 [2025-02-05 19:13:57,094 INFO L226 Difference]: Without dead ends: 483 [2025-02-05 19:13:57,095 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-05 19:13:57,096 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:13:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1777 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:13:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-02-05 19:13:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-02-05 19:13:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.491701244813278) internal successors, (719), 482 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2025-02-05 19:13:57,110 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 22 [2025-02-05 19:13:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:13:57,110 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2025-02-05 19:13:57,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2025-02-05 19:13:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 19:13:57,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:57,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:57,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:13:57,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:57,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -350738742, now seen corresponding path program 1 times [2025-02-05 19:13:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514494425] [2025-02-05 19:13:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:57,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 19:13:57,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 19:13:57,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:57,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514494425] [2025-02-05 19:13:57,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514494425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:57,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:13:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575812841] [2025-02-05 19:13:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:57,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:13:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:57,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:13:57,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:13:57,390 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:13:58,202 INFO L93 Difference]: Finished difference Result 1404 states and 2092 transitions. [2025-02-05 19:13:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:13:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 19:13:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:13:58,208 INFO L225 Difference]: With dead ends: 1404 [2025-02-05 19:13:58,208 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 19:13:58,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:13:58,210 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 751 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:13:58,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3451 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:13:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 19:13:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 492. [2025-02-05 19:13:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4887983706720977) internal successors, (731), 491 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 731 transitions. [2025-02-05 19:13:58,231 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 731 transitions. Word has length 23 [2025-02-05 19:13:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:13:58,232 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 731 transitions. [2025-02-05 19:13:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2025-02-05 19:13:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 19:13:58,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:58,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:13:58,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1091076710, now seen corresponding path program 1 times [2025-02-05 19:13:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370330253] [2025-02-05 19:13:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:58,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 19:13:58,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 19:13:58,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:58,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:58,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370330253] [2025-02-05 19:13:58,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370330253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:58,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:13:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081613894] [2025-02-05 19:13:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:13:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:58,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:13:58,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:13:58,537 INFO L87 Difference]: Start difference. First operand 492 states and 731 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:13:59,103 INFO L93 Difference]: Finished difference Result 1041 states and 1542 transitions. [2025-02-05 19:13:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:13:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 19:13:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:13:59,105 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 19:13:59,105 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 19:13:59,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:13:59,106 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 118 mSDsluCounter, 4652 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:13:59,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 5236 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:13:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 19:13:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 504. [2025-02-05 19:13:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.4831013916500995) internal successors, (746), 503 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 746 transitions. [2025-02-05 19:13:59,114 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 746 transitions. Word has length 24 [2025-02-05 19:13:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:13:59,114 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 746 transitions. [2025-02-05 19:13:59,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 746 transitions. [2025-02-05 19:13:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 19:13:59,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:59,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:59,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:13:59,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:59,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1394701813, now seen corresponding path program 1 times [2025-02-05 19:13:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:59,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532413895] [2025-02-05 19:13:59,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:59,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 19:13:59,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 19:13:59,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:59,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532413895] [2025-02-05 19:13:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532413895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:13:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586707586] [2025-02-05 19:13:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:13:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:13:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:13:59,218 INFO L87 Difference]: Start difference. First operand 504 states and 746 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:13:59,412 INFO L93 Difference]: Finished difference Result 981 states and 1457 transitions. [2025-02-05 19:13:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:13:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 19:13:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:13:59,415 INFO L225 Difference]: With dead ends: 981 [2025-02-05 19:13:59,415 INFO L226 Difference]: Without dead ends: 508 [2025-02-05 19:13:59,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:13:59,416 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 705 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:13:59,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1776 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:13:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-05 19:13:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2025-02-05 19:13:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4802371541501975) internal successors, (749), 506 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 749 transitions. [2025-02-05 19:13:59,423 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 749 transitions. Word has length 24 [2025-02-05 19:13:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:13:59,423 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 749 transitions. [2025-02-05 19:13:59,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:13:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 749 transitions. [2025-02-05 19:13:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 19:13:59,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:13:59,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:13:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:13:59,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:13:59,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:13:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1352002917, now seen corresponding path program 1 times [2025-02-05 19:13:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:13:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39274898] [2025-02-05 19:13:59,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:13:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:13:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 19:13:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 19:13:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:13:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:13:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:13:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:13:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39274898] [2025-02-05 19:13:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39274898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:13:59,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:13:59,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:13:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635420493] [2025-02-05 19:13:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:13:59,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:13:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:13:59,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:13:59,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:13:59,675 INFO L87 Difference]: Start difference. First operand 507 states and 749 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:00,215 INFO L93 Difference]: Finished difference Result 1048 states and 1548 transitions. [2025-02-05 19:14:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 19:14:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:00,217 INFO L225 Difference]: With dead ends: 1048 [2025-02-05 19:14:00,217 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 19:14:00,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:14:00,218 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 118 mSDsluCounter, 4645 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 5228 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:00,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 5228 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 19:14:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 513. [2025-02-05 19:14:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.478515625) internal successors, (757), 512 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 757 transitions. [2025-02-05 19:14:00,236 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 757 transitions. Word has length 25 [2025-02-05 19:14:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 757 transitions. [2025-02-05 19:14:00,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 757 transitions. [2025-02-05 19:14:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 19:14:00,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:00,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:00,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:14:00,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:00,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -796376132, now seen corresponding path program 1 times [2025-02-05 19:14:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:00,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876983554] [2025-02-05 19:14:00,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 19:14:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 19:14:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876983554] [2025-02-05 19:14:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876983554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924619979] [2025-02-05 19:14:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:00,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:00,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:00,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:00,382 INFO L87 Difference]: Start difference. First operand 513 states and 757 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:00,832 INFO L93 Difference]: Finished difference Result 1370 states and 2029 transitions. [2025-02-05 19:14:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 19:14:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:00,835 INFO L225 Difference]: With dead ends: 1370 [2025-02-05 19:14:00,835 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 19:14:00,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:00,837 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 610 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:00,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 3489 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 19:14:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 505. [2025-02-05 19:14:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4742063492063493) internal successors, (743), 504 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 743 transitions. [2025-02-05 19:14:00,849 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 743 transitions. Word has length 25 [2025-02-05 19:14:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 743 transitions. [2025-02-05 19:14:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 743 transitions. [2025-02-05 19:14:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 19:14:00,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:00,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:00,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:14:00,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1732224637, now seen corresponding path program 1 times [2025-02-05 19:14:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965652721] [2025-02-05 19:14:00,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:00,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 19:14:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 19:14:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:01,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965652721] [2025-02-05 19:14:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965652721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 19:14:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384703753] [2025-02-05 19:14:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:01,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 19:14:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:01,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 19:14:01,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:01,173 INFO L87 Difference]: Start difference. First operand 505 states and 743 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:01,612 INFO L93 Difference]: Finished difference Result 1033 states and 1523 transitions. [2025-02-05 19:14:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:14:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 19:14:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:01,614 INFO L225 Difference]: With dead ends: 1033 [2025-02-05 19:14:01,614 INFO L226 Difference]: Without dead ends: 557 [2025-02-05 19:14:01,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-05 19:14:01,615 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 92 mSDsluCounter, 3490 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4073 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:01,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4073 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-05 19:14:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 505. [2025-02-05 19:14:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4722222222222223) internal successors, (742), 504 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 742 transitions. [2025-02-05 19:14:01,625 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 742 transitions. Word has length 26 [2025-02-05 19:14:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:01,625 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 742 transitions. [2025-02-05 19:14:01,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 742 transitions. [2025-02-05 19:14:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 19:14:01,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:01,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:01,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:14:01,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1871041379, now seen corresponding path program 1 times [2025-02-05 19:14:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508241440] [2025-02-05 19:14:01,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:01,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:01,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 19:14:01,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 19:14:01,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:01,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508241440] [2025-02-05 19:14:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508241440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:01,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708512308] [2025-02-05 19:14:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:01,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:01,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:01,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:01,707 INFO L87 Difference]: Start difference. First operand 505 states and 742 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:01,922 INFO L93 Difference]: Finished difference Result 994 states and 1467 transitions. [2025-02-05 19:14:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 19:14:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:01,924 INFO L225 Difference]: With dead ends: 994 [2025-02-05 19:14:01,924 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 19:14:01,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:01,925 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 36 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:01,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2353 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 19:14:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 498. [2025-02-05 19:14:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.476861167002012) internal successors, (734), 497 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 734 transitions. [2025-02-05 19:14:01,931 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 734 transitions. Word has length 27 [2025-02-05 19:14:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:01,932 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 734 transitions. [2025-02-05 19:14:01,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 734 transitions. [2025-02-05 19:14:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 19:14:01,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:01,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:01,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 19:14:01,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:01,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash 662654040, now seen corresponding path program 1 times [2025-02-05 19:14:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262058120] [2025-02-05 19:14:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 19:14:02,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 19:14:02,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262058120] [2025-02-05 19:14:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262058120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:14:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353889404] [2025-02-05 19:14:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:14:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:14:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:14:04,037 INFO L87 Difference]: Start difference. First operand 498 states and 734 transitions. Second operand has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:04,683 INFO L93 Difference]: Finished difference Result 1655 states and 2461 transitions. [2025-02-05 19:14:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:14:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-02-05 19:14:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:04,687 INFO L225 Difference]: With dead ends: 1655 [2025-02-05 19:14:04,687 INFO L226 Difference]: Without dead ends: 1179 [2025-02-05 19:14:04,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-05 19:14:04,689 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1270 mSDsluCounter, 4555 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:04,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 5134 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-02-05 19:14:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 742. [2025-02-05 19:14:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4804318488529016) internal successors, (1097), 741 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1097 transitions. [2025-02-05 19:14:04,704 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1097 transitions. Word has length 261 [2025-02-05 19:14:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:04,705 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1097 transitions. [2025-02-05 19:14:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1097 transitions. [2025-02-05 19:14:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 19:14:04,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:04,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:04,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 19:14:04,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1429670175, now seen corresponding path program 1 times [2025-02-05 19:14:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:04,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92536921] [2025-02-05 19:14:04,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:04,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 19:14:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 19:14:05,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:05,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92536921] [2025-02-05 19:14:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92536921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:05,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:05,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386093124] [2025-02-05 19:14:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:05,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:05,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:05,823 INFO L87 Difference]: Start difference. First operand 742 states and 1097 transitions. Second operand has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:06,347 INFO L93 Difference]: Finished difference Result 1684 states and 2504 transitions. [2025-02-05 19:14:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:06,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-02-05 19:14:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:06,351 INFO L225 Difference]: With dead ends: 1684 [2025-02-05 19:14:06,351 INFO L226 Difference]: Without dead ends: 1208 [2025-02-05 19:14:06,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:14:06,352 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 664 mSDsluCounter, 4053 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:06,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 4635 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-02-05 19:14:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1081. [2025-02-05 19:14:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.4851851851851852) internal successors, (1604), 1080 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1604 transitions. [2025-02-05 19:14:06,366 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1604 transitions. Word has length 262 [2025-02-05 19:14:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:06,366 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1604 transitions. [2025-02-05 19:14:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1604 transitions. [2025-02-05 19:14:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 19:14:06,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:06,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 19:14:06,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash -684436575, now seen corresponding path program 1 times [2025-02-05 19:14:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529942048] [2025-02-05 19:14:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:06,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 19:14:06,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 19:14:06,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:06,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:07,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529942048] [2025-02-05 19:14:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529942048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:07,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:07,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605338046] [2025-02-05 19:14:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:07,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:07,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:07,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:07,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:07,547 INFO L87 Difference]: Start difference. First operand 1081 states and 1604 transitions. Second operand has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:08,010 INFO L93 Difference]: Finished difference Result 2028 states and 3016 transitions. [2025-02-05 19:14:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-02-05 19:14:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:08,015 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 19:14:08,015 INFO L226 Difference]: Without dead ends: 1492 [2025-02-05 19:14:08,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:14:08,016 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1357 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:08,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 3569 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-02-05 19:14:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1425. [2025-02-05 19:14:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1424 states have (on average 1.4859550561797752) internal successors, (2116), 1424 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2116 transitions. [2025-02-05 19:14:08,034 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2116 transitions. Word has length 263 [2025-02-05 19:14:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:08,034 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2116 transitions. [2025-02-05 19:14:08,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2116 transitions. [2025-02-05 19:14:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 19:14:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:08,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 19:14:08,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -767106957, now seen corresponding path program 1 times [2025-02-05 19:14:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22344472] [2025-02-05 19:14:08,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:08,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 19:14:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 19:14:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22344472] [2025-02-05 19:14:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22344472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:09,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547012742] [2025-02-05 19:14:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:09,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:09,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:09,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:09,098 INFO L87 Difference]: Start difference. First operand 1425 states and 2116 transitions. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:09,456 INFO L93 Difference]: Finished difference Result 2564 states and 3812 transitions. [2025-02-05 19:14:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-02-05 19:14:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:09,463 INFO L225 Difference]: With dead ends: 2564 [2025-02-05 19:14:09,463 INFO L226 Difference]: Without dead ends: 2077 [2025-02-05 19:14:09,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:09,464 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 673 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:09,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 2921 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:14:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-02-05 19:14:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2073. [2025-02-05 19:14:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.486969111969112) internal successors, (3081), 2072 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3081 transitions. [2025-02-05 19:14:09,490 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3081 transitions. Word has length 264 [2025-02-05 19:14:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:09,491 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3081 transitions. [2025-02-05 19:14:09,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3081 transitions. [2025-02-05 19:14:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 19:14:09,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:09,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 19:14:09,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1891082914, now seen corresponding path program 1 times [2025-02-05 19:14:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:09,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590895307] [2025-02-05 19:14:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:09,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 19:14:09,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 19:14:09,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:09,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590895307] [2025-02-05 19:14:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590895307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 19:14:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989477703] [2025-02-05 19:14:10,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 19:14:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:10,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 19:14:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:14:10,938 INFO L87 Difference]: Start difference. First operand 2073 states and 3081 transitions. Second operand has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:11,653 INFO L93 Difference]: Finished difference Result 5320 states and 7932 transitions. [2025-02-05 19:14:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 19:14:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-02-05 19:14:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:11,662 INFO L225 Difference]: With dead ends: 5320 [2025-02-05 19:14:11,662 INFO L226 Difference]: Without dead ends: 3305 [2025-02-05 19:14:11,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-05 19:14:11,666 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1071 mSDsluCounter, 5104 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:11,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 5674 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-02-05 19:14:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3289. [2025-02-05 19:14:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 1.4850973236009732) internal successors, (4883), 3288 states have internal predecessors, (4883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4883 transitions. [2025-02-05 19:14:11,705 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4883 transitions. Word has length 265 [2025-02-05 19:14:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 4883 transitions. [2025-02-05 19:14:11,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4883 transitions. [2025-02-05 19:14:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 19:14:11,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:11,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:11,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 19:14:11,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1057893930, now seen corresponding path program 1 times [2025-02-05 19:14:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634044005] [2025-02-05 19:14:11,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 19:14:12,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 19:14:12,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:12,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634044005] [2025-02-05 19:14:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634044005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:14:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212391444] [2025-02-05 19:14:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:14:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:13,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:14:13,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:14:13,152 INFO L87 Difference]: Start difference. First operand 3289 states and 4883 transitions. Second operand has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:13,743 INFO L93 Difference]: Finished difference Result 6239 states and 9258 transitions. [2025-02-05 19:14:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:14:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-02-05 19:14:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:13,751 INFO L225 Difference]: With dead ends: 6239 [2025-02-05 19:14:13,751 INFO L226 Difference]: Without dead ends: 3611 [2025-02-05 19:14:13,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:14:13,754 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 662 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:13,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 5210 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2025-02-05 19:14:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3314. [2025-02-05 19:14:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3313 states have (on average 1.4847570178086327) internal successors, (4919), 3313 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4919 transitions. [2025-02-05 19:14:13,792 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4919 transitions. Word has length 266 [2025-02-05 19:14:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 4919 transitions. [2025-02-05 19:14:13,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4919 transitions. [2025-02-05 19:14:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 19:14:13,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:13,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:13,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:14:13,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1337087434, now seen corresponding path program 1 times [2025-02-05 19:14:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690025666] [2025-02-05 19:14:13,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:13,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 19:14:13,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 19:14:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690025666] [2025-02-05 19:14:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690025666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132776026] [2025-02-05 19:14:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:14,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:14,102 INFO L87 Difference]: Start difference. First operand 3314 states and 4919 transitions. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:14,344 INFO L93 Difference]: Finished difference Result 5941 states and 8827 transitions. [2025-02-05 19:14:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-02-05 19:14:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:14,352 INFO L225 Difference]: With dead ends: 5941 [2025-02-05 19:14:14,352 INFO L226 Difference]: Without dead ends: 3332 [2025-02-05 19:14:14,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:14,356 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:14,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2362 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2025-02-05 19:14:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3332. [2025-02-05 19:14:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3331 states have (on average 1.483938757129991) internal successors, (4943), 3331 states have internal predecessors, (4943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4943 transitions. [2025-02-05 19:14:14,392 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4943 transitions. Word has length 266 [2025-02-05 19:14:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4943 transitions. [2025-02-05 19:14:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4943 transitions. [2025-02-05 19:14:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-05 19:14:14,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:14,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:14,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 19:14:14,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:14,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1046434939, now seen corresponding path program 1 times [2025-02-05 19:14:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629951569] [2025-02-05 19:14:14,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:14,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 19:14:14,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 19:14:14,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:14,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629951569] [2025-02-05 19:14:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629951569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688198586] [2025-02-05 19:14:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:14,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:14,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:14,659 INFO L87 Difference]: Start difference. First operand 3332 states and 4943 transitions. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:14,866 INFO L93 Difference]: Finished difference Result 6564 states and 9748 transitions. [2025-02-05 19:14:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-02-05 19:14:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:14,874 INFO L225 Difference]: With dead ends: 6564 [2025-02-05 19:14:14,877 INFO L226 Difference]: Without dead ends: 3350 [2025-02-05 19:14:14,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:14,880 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:14,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2362 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2025-02-05 19:14:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3350. [2025-02-05 19:14:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3349 states have (on average 1.4831292923260675) internal successors, (4967), 3349 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4967 transitions. [2025-02-05 19:14:14,917 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4967 transitions. Word has length 267 [2025-02-05 19:14:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:14,917 INFO L471 AbstractCegarLoop]: Abstraction has 3350 states and 4967 transitions. [2025-02-05 19:14:14,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4967 transitions. [2025-02-05 19:14:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-05 19:14:14,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:14,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:14,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 19:14:14,927 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1800266444, now seen corresponding path program 1 times [2025-02-05 19:14:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:14,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914279871] [2025-02-05 19:14:14,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:14,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 19:14:15,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 19:14:15,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:15,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914279871] [2025-02-05 19:14:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914279871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:15,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:15,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126020454] [2025-02-05 19:14:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:15,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:15,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:15,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:15,947 INFO L87 Difference]: Start difference. First operand 3350 states and 4967 transitions. Second operand has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:16,673 INFO L93 Difference]: Finished difference Result 5309 states and 7878 transitions. [2025-02-05 19:14:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-02-05 19:14:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:16,687 INFO L225 Difference]: With dead ends: 5309 [2025-02-05 19:14:16,689 INFO L226 Difference]: Without dead ends: 4319 [2025-02-05 19:14:16,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:14:16,691 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 743 mSDsluCounter, 7233 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 8356 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:16,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 8356 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2025-02-05 19:14:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3363. [2025-02-05 19:14:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 3362 states have (on average 1.4824509220701962) internal successors, (4984), 3362 states have internal predecessors, (4984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4984 transitions. [2025-02-05 19:14:16,722 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4984 transitions. Word has length 267 [2025-02-05 19:14:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 3363 states and 4984 transitions. [2025-02-05 19:14:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4984 transitions. [2025-02-05 19:14:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 19:14:16,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:16,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:16,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 19:14:16,727 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:16,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash -979836779, now seen corresponding path program 1 times [2025-02-05 19:14:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:16,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341127346] [2025-02-05 19:14:16,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:16,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 19:14:17,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 19:14:17,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:17,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341127346] [2025-02-05 19:14:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341127346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631214233] [2025-02-05 19:14:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:17,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:17,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:17,519 INFO L87 Difference]: Start difference. First operand 3363 states and 4984 transitions. Second operand has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:17,803 INFO L93 Difference]: Finished difference Result 4371 states and 6480 transitions. [2025-02-05 19:14:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 19:14:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:17,813 INFO L225 Difference]: With dead ends: 4371 [2025-02-05 19:14:17,813 INFO L226 Difference]: Without dead ends: 3368 [2025-02-05 19:14:17,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:17,814 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 475 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:17,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2906 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:14:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2025-02-05 19:14:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3368. [2025-02-05 19:14:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.482031482031482) internal successors, (4990), 3367 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4990 transitions. [2025-02-05 19:14:17,869 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4990 transitions. Word has length 268 [2025-02-05 19:14:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4990 transitions. [2025-02-05 19:14:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4990 transitions. [2025-02-05 19:14:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 19:14:17,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:17,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:17,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 19:14:17,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -328645814, now seen corresponding path program 1 times [2025-02-05 19:14:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:17,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392636073] [2025-02-05 19:14:17,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:17,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 19:14:18,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 19:14:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392636073] [2025-02-05 19:14:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392636073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 19:14:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059852523] [2025-02-05 19:14:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:18,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 19:14:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:18,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 19:14:18,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:14:18,919 INFO L87 Difference]: Start difference. First operand 3368 states and 4990 transitions. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:19,596 INFO L93 Difference]: Finished difference Result 4450 states and 6587 transitions. [2025-02-05 19:14:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 19:14:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 19:14:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:19,602 INFO L225 Difference]: With dead ends: 4450 [2025-02-05 19:14:19,602 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 19:14:19,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 19:14:19,603 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 111 mSDsluCounter, 5617 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 6248 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:19,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 6248 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 19:14:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3380. [2025-02-05 19:14:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.4812074578277596) internal successors, (5005), 3379 states have internal predecessors, (5005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 5005 transitions. [2025-02-05 19:14:19,638 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 5005 transitions. Word has length 268 [2025-02-05 19:14:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 5005 transitions. [2025-02-05 19:14:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 5005 transitions. [2025-02-05 19:14:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 19:14:19,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:19,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:19,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 19:14:19,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2070010350, now seen corresponding path program 1 times [2025-02-05 19:14:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441477409] [2025-02-05 19:14:19,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:19,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 19:14:19,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 19:14:19,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:19,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:20,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441477409] [2025-02-05 19:14:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441477409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:20,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575114015] [2025-02-05 19:14:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:20,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:20,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:20,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:20,210 INFO L87 Difference]: Start difference. First operand 3380 states and 5005 transitions. Second operand has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:20,536 INFO L93 Difference]: Finished difference Result 6537 states and 9699 transitions. [2025-02-05 19:14:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:14:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 19:14:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:20,544 INFO L225 Difference]: With dead ends: 6537 [2025-02-05 19:14:20,544 INFO L226 Difference]: Without dead ends: 4764 [2025-02-05 19:14:20,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:20,546 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 93 mSDsluCounter, 4072 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4657 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:20,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 4657 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:14:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-02-05 19:14:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4764. [2025-02-05 19:14:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4764 states, 4763 states have (on average 1.4799496115893345) internal successors, (7049), 4763 states have internal predecessors, (7049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7049 transitions. [2025-02-05 19:14:20,580 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7049 transitions. Word has length 268 [2025-02-05 19:14:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:20,581 INFO L471 AbstractCegarLoop]: Abstraction has 4764 states and 7049 transitions. [2025-02-05 19:14:20,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7049 transitions. [2025-02-05 19:14:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 19:14:20,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:20,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 19:14:20,585 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1592546724, now seen corresponding path program 1 times [2025-02-05 19:14:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376998012] [2025-02-05 19:14:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:20,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 19:14:20,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 19:14:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376998012] [2025-02-05 19:14:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376998012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846001456] [2025-02-05 19:14:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:21,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:21,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:21,523 INFO L87 Difference]: Start difference. First operand 4764 states and 7049 transitions. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:21,726 INFO L93 Difference]: Finished difference Result 6151 states and 9098 transitions. [2025-02-05 19:14:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:14:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 19:14:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:21,737 INFO L225 Difference]: With dead ends: 6151 [2025-02-05 19:14:21,737 INFO L226 Difference]: Without dead ends: 4764 [2025-02-05 19:14:21,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:21,742 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 795 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:21,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2200 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-02-05 19:14:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4764. [2025-02-05 19:14:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4764 states, 4763 states have (on average 1.4795297081671215) internal successors, (7047), 4763 states have internal predecessors, (7047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7047 transitions. [2025-02-05 19:14:21,857 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7047 transitions. Word has length 268 [2025-02-05 19:14:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 4764 states and 7047 transitions. [2025-02-05 19:14:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7047 transitions. [2025-02-05 19:14:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 19:14:21,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:21,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:21,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 19:14:21,867 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 659231918, now seen corresponding path program 1 times [2025-02-05 19:14:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374568544] [2025-02-05 19:14:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 19:14:22,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 19:14:22,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:23,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374568544] [2025-02-05 19:14:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374568544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:23,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:23,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 19:14:23,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974337876] [2025-02-05 19:14:23,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:23,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 19:14:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:23,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 19:14:23,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:23,155 INFO L87 Difference]: Start difference. First operand 4764 states and 7047 transitions. Second operand has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:23,628 INFO L93 Difference]: Finished difference Result 10145 states and 15027 transitions. [2025-02-05 19:14:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:14:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 19:14:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:23,636 INFO L225 Difference]: With dead ends: 10145 [2025-02-05 19:14:23,636 INFO L226 Difference]: Without dead ends: 6292 [2025-02-05 19:14:23,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:23,640 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 137 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:23,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5318 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2025-02-05 19:14:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 5596. [2025-02-05 19:14:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.4736371760500446) internal successors, (8245), 5595 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 8245 transitions. [2025-02-05 19:14:23,678 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 8245 transitions. Word has length 268 [2025-02-05 19:14:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:23,679 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 8245 transitions. [2025-02-05 19:14:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 8245 transitions. [2025-02-05 19:14:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 19:14:23,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:23,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 19:14:23,684 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1097102790, now seen corresponding path program 1 times [2025-02-05 19:14:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462365731] [2025-02-05 19:14:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 19:14:24,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 19:14:24,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:24,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462365731] [2025-02-05 19:14:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462365731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:25,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:25,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 19:14:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290144834] [2025-02-05 19:14:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:25,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 19:14:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:25,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 19:14:25,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:14:25,960 INFO L87 Difference]: Start difference. First operand 5596 states and 8245 transitions. Second operand has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:27,398 INFO L93 Difference]: Finished difference Result 13621 states and 20061 transitions. [2025-02-05 19:14:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 19:14:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2025-02-05 19:14:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:27,424 INFO L225 Difference]: With dead ends: 13621 [2025-02-05 19:14:27,424 INFO L226 Difference]: Without dead ends: 10848 [2025-02-05 19:14:27,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-02-05 19:14:27,432 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 2184 mSDsluCounter, 6896 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 7461 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:27,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 7461 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 19:14:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10848 states. [2025-02-05 19:14:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10848 to 8341. [2025-02-05 19:14:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8341 states, 8340 states have (on average 1.4701438848920863) internal successors, (12261), 8340 states have internal predecessors, (12261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 12261 transitions. [2025-02-05 19:14:27,572 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 12261 transitions. Word has length 269 [2025-02-05 19:14:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 8341 states and 12261 transitions. [2025-02-05 19:14:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 12261 transitions. [2025-02-05 19:14:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 19:14:27,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:27,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:27,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 19:14:27,593 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash -947200346, now seen corresponding path program 1 times [2025-02-05 19:14:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197116288] [2025-02-05 19:14:27,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 19:14:28,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 19:14:28,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:28,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197116288] [2025-02-05 19:14:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197116288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872369284] [2025-02-05 19:14:28,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:28,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:28,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:28,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:28,978 INFO L87 Difference]: Start difference. First operand 8341 states and 12261 transitions. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:29,495 INFO L93 Difference]: Finished difference Result 12686 states and 18665 transitions. [2025-02-05 19:14:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:14:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2025-02-05 19:14:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:29,506 INFO L225 Difference]: With dead ends: 12686 [2025-02-05 19:14:29,506 INFO L226 Difference]: Without dead ends: 10869 [2025-02-05 19:14:29,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:29,509 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 741 mSDsluCounter, 3645 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:29,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4223 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10869 states. [2025-02-05 19:14:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10869 to 10861. [2025-02-05 19:14:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.4693370165745856) internal successors, (15957), 10860 states have internal predecessors, (15957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 15957 transitions. [2025-02-05 19:14:29,620 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 15957 transitions. Word has length 270 [2025-02-05 19:14:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:29,620 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 15957 transitions. [2025-02-05 19:14:29,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 15957 transitions. [2025-02-05 19:14:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 19:14:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:29,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 19:14:29,632 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1272650323, now seen corresponding path program 1 times [2025-02-05 19:14:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524796670] [2025-02-05 19:14:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:29,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 19:14:29,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 19:14:29,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:29,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524796670] [2025-02-05 19:14:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524796670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:29,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498534463] [2025-02-05 19:14:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:29,987 INFO L87 Difference]: Start difference. First operand 10861 states and 15957 transitions. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:30,208 INFO L93 Difference]: Finished difference Result 17673 states and 26006 transitions. [2025-02-05 19:14:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2025-02-05 19:14:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:30,217 INFO L225 Difference]: With dead ends: 17673 [2025-02-05 19:14:30,217 INFO L226 Difference]: Without dead ends: 10873 [2025-02-05 19:14:30,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:30,224 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 3 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:30,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2950 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10873 states. [2025-02-05 19:14:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10873 to 10873. [2025-02-05 19:14:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10873 states, 10872 states have (on average 1.4690029433406917) internal successors, (15971), 10872 states have internal predecessors, (15971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 15971 transitions. [2025-02-05 19:14:30,332 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 15971 transitions. Word has length 270 [2025-02-05 19:14:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:30,333 INFO L471 AbstractCegarLoop]: Abstraction has 10873 states and 15971 transitions. [2025-02-05 19:14:30,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 15971 transitions. [2025-02-05 19:14:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 19:14:30,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:30,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:30,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 19:14:30,342 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash 330718375, now seen corresponding path program 1 times [2025-02-05 19:14:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491682489] [2025-02-05 19:14:30,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 19:14:30,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 19:14:30,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:30,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491682489] [2025-02-05 19:14:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491682489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:31,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:14:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772799402] [2025-02-05 19:14:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:14:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:31,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:14:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:14:31,434 INFO L87 Difference]: Start difference. First operand 10873 states and 15971 transitions. Second operand has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:31,795 INFO L93 Difference]: Finished difference Result 21620 states and 31776 transitions. [2025-02-05 19:14:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:14:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-02-05 19:14:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:31,804 INFO L225 Difference]: With dead ends: 21620 [2025-02-05 19:14:31,804 INFO L226 Difference]: Without dead ends: 11041 [2025-02-05 19:14:31,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:14:31,812 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 462 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3730 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:31,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3730 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:14:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11041 states. [2025-02-05 19:14:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11041 to 11023. [2025-02-05 19:14:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11023 states, 11022 states have (on average 1.468063872255489) internal successors, (16181), 11022 states have internal predecessors, (16181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11023 states to 11023 states and 16181 transitions. [2025-02-05 19:14:31,879 INFO L78 Accepts]: Start accepts. Automaton has 11023 states and 16181 transitions. Word has length 271 [2025-02-05 19:14:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 11023 states and 16181 transitions. [2025-02-05 19:14:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11023 states and 16181 transitions. [2025-02-05 19:14:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 19:14:31,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:31,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 19:14:31,887 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1778961639, now seen corresponding path program 1 times [2025-02-05 19:14:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990399391] [2025-02-05 19:14:31,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:31,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 19:14:31,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 19:14:31,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:31,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990399391] [2025-02-05 19:14:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990399391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894776766] [2025-02-05 19:14:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:32,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:32,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:32,155 INFO L87 Difference]: Start difference. First operand 11023 states and 16181 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:32,342 INFO L93 Difference]: Finished difference Result 18004 states and 26456 transitions. [2025-02-05 19:14:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-02-05 19:14:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:32,350 INFO L225 Difference]: With dead ends: 18004 [2025-02-05 19:14:32,350 INFO L226 Difference]: Without dead ends: 11095 [2025-02-05 19:14:32,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:32,356 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 4 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:32,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11095 states. [2025-02-05 19:14:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11095 to 11095. [2025-02-05 19:14:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11095 states, 11094 states have (on average 1.4671894717865512) internal successors, (16277), 11094 states have internal predecessors, (16277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11095 states to 11095 states and 16277 transitions. [2025-02-05 19:14:32,424 INFO L78 Accepts]: Start accepts. Automaton has 11095 states and 16277 transitions. Word has length 271 [2025-02-05 19:14:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 11095 states and 16277 transitions. [2025-02-05 19:14:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 11095 states and 16277 transitions. [2025-02-05 19:14:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 19:14:32,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:32,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 19:14:32,431 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1224260810, now seen corresponding path program 1 times [2025-02-05 19:14:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658345168] [2025-02-05 19:14:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:32,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 19:14:33,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 19:14:33,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:33,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658345168] [2025-02-05 19:14:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658345168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 19:14:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928293336] [2025-02-05 19:14:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:33,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 19:14:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:33,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 19:14:33,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:14:33,816 INFO L87 Difference]: Start difference. First operand 11095 states and 16277 transitions. Second operand has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:34,477 INFO L93 Difference]: Finished difference Result 14053 states and 20628 transitions. [2025-02-05 19:14:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 19:14:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-02-05 19:14:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:34,485 INFO L225 Difference]: With dead ends: 14053 [2025-02-05 19:14:34,485 INFO L226 Difference]: Without dead ends: 11161 [2025-02-05 19:14:34,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-05 19:14:34,489 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 111 mSDsluCounter, 6227 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 6857 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:34,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 6857 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:14:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2025-02-05 19:14:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11101. [2025-02-05 19:14:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11101 states, 11100 states have (on average 1.4671171171171171) internal successors, (16285), 11100 states have internal predecessors, (16285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11101 states to 11101 states and 16285 transitions. [2025-02-05 19:14:34,562 INFO L78 Accepts]: Start accepts. Automaton has 11101 states and 16285 transitions. Word has length 272 [2025-02-05 19:14:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 11101 states and 16285 transitions. [2025-02-05 19:14:34,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11101 states and 16285 transitions. [2025-02-05 19:14:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 19:14:34,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:34,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 19:14:34,570 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:34,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -924118239, now seen corresponding path program 1 times [2025-02-05 19:14:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116389893] [2025-02-05 19:14:34,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:34,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 19:14:35,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 19:14:35,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:35,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116389893] [2025-02-05 19:14:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116389893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:14:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824980980] [2025-02-05 19:14:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:35,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:14:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:35,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:14:35,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:14:35,677 INFO L87 Difference]: Start difference. First operand 11101 states and 16285 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:36,494 INFO L93 Difference]: Finished difference Result 16923 states and 24851 transitions. [2025-02-05 19:14:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-02-05 19:14:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:36,511 INFO L225 Difference]: With dead ends: 16923 [2025-02-05 19:14:36,517 INFO L226 Difference]: Without dead ends: 13982 [2025-02-05 19:14:36,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:14:36,527 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 665 mSDsluCounter, 7755 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 8786 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:36,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 8786 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13982 states. [2025-02-05 19:14:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13982 to 11246. [2025-02-05 19:14:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11246 states, 11245 states have (on average 1.4664295242329923) internal successors, (16490), 11245 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 16490 transitions. [2025-02-05 19:14:36,652 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 16490 transitions. Word has length 272 [2025-02-05 19:14:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:36,652 INFO L471 AbstractCegarLoop]: Abstraction has 11246 states and 16490 transitions. [2025-02-05 19:14:36,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 16490 transitions. [2025-02-05 19:14:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 19:14:36,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:36,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 19:14:36,660 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -298503988, now seen corresponding path program 1 times [2025-02-05 19:14:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973547712] [2025-02-05 19:14:36,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 19:14:36,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 19:14:36,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:36,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973547712] [2025-02-05 19:14:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973547712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:36,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:36,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297868679] [2025-02-05 19:14:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:36,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:36,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:36,984 INFO L87 Difference]: Start difference. First operand 11246 states and 16490 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:37,182 INFO L93 Difference]: Finished difference Result 14370 states and 21078 transitions. [2025-02-05 19:14:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-02-05 19:14:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:37,190 INFO L225 Difference]: With dead ends: 14370 [2025-02-05 19:14:37,191 INFO L226 Difference]: Without dead ends: 11374 [2025-02-05 19:14:37,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:37,194 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 34 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:37,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11374 states. [2025-02-05 19:14:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11374 to 11374. [2025-02-05 19:14:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11374 states, 11373 states have (on average 1.465576365075178) internal successors, (16668), 11373 states have internal predecessors, (16668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11374 states to 11374 states and 16668 transitions. [2025-02-05 19:14:37,267 INFO L78 Accepts]: Start accepts. Automaton has 11374 states and 16668 transitions. Word has length 272 [2025-02-05 19:14:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:37,267 INFO L471 AbstractCegarLoop]: Abstraction has 11374 states and 16668 transitions. [2025-02-05 19:14:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11374 states and 16668 transitions. [2025-02-05 19:14:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:37,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:37,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:37,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 19:14:37,274 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 282976404, now seen corresponding path program 1 times [2025-02-05 19:14:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717883518] [2025-02-05 19:14:37,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:37,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:37,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:37,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717883518] [2025-02-05 19:14:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717883518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187915995] [2025-02-05 19:14:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:37,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:37,742 INFO L87 Difference]: Start difference. First operand 11374 states and 16668 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:37,975 INFO L93 Difference]: Finished difference Result 14503 states and 21259 transitions. [2025-02-05 19:14:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:37,983 INFO L225 Difference]: With dead ends: 14503 [2025-02-05 19:14:37,983 INFO L226 Difference]: Without dead ends: 11368 [2025-02-05 19:14:37,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-05 19:14:37,987 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 168 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:37,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 2357 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11368 states. [2025-02-05 19:14:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11368 to 11368. [2025-02-05 19:14:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11368 states, 11367 states have (on average 1.465294272895223) internal successors, (16656), 11367 states have internal predecessors, (16656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 16656 transitions. [2025-02-05 19:14:38,058 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 16656 transitions. Word has length 273 [2025-02-05 19:14:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:38,059 INFO L471 AbstractCegarLoop]: Abstraction has 11368 states and 16656 transitions. [2025-02-05 19:14:38,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 16656 transitions. [2025-02-05 19:14:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:38,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:38,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 19:14:38,066 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:38,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1397262658, now seen corresponding path program 1 times [2025-02-05 19:14:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352405919] [2025-02-05 19:14:38,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:38,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:38,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:38,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:38,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:39,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352405919] [2025-02-05 19:14:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352405919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 19:14:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459266875] [2025-02-05 19:14:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:39,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 19:14:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:39,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 19:14:39,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:14:39,334 INFO L87 Difference]: Start difference. First operand 11368 states and 16656 transitions. Second operand has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:39,958 INFO L93 Difference]: Finished difference Result 14518 states and 21275 transitions. [2025-02-05 19:14:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 19:14:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:39,966 INFO L225 Difference]: With dead ends: 14518 [2025-02-05 19:14:39,966 INFO L226 Difference]: Without dead ends: 11431 [2025-02-05 19:14:39,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 19:14:39,969 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 110 mSDsluCounter, 5610 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 6240 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:39,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 6240 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:14:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2025-02-05 19:14:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 11371. [2025-02-05 19:14:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11371 states, 11370 states have (on average 1.4651715039577837) internal successors, (16659), 11370 states have internal predecessors, (16659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11371 states to 11371 states and 16659 transitions. [2025-02-05 19:14:40,042 INFO L78 Accepts]: Start accepts. Automaton has 11371 states and 16659 transitions. Word has length 273 [2025-02-05 19:14:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 11371 states and 16659 transitions. [2025-02-05 19:14:40,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 11371 states and 16659 transitions. [2025-02-05 19:14:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:40,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 19:14:40,050 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -650506191, now seen corresponding path program 1 times [2025-02-05 19:14:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984598298] [2025-02-05 19:14:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:40,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984598298] [2025-02-05 19:14:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984598298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:41,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691047281] [2025-02-05 19:14:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:41,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:41,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:41,103 INFO L87 Difference]: Start difference. First operand 11371 states and 16659 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:41,835 INFO L93 Difference]: Finished difference Result 17187 states and 25208 transitions. [2025-02-05 19:14:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:14:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:41,847 INFO L225 Difference]: With dead ends: 17187 [2025-02-05 19:14:41,847 INFO L226 Difference]: Without dead ends: 14097 [2025-02-05 19:14:41,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:14:41,852 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 658 mSDsluCounter, 6736 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 7769 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:41,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 7769 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:14:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2025-02-05 19:14:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 11369. [2025-02-05 19:14:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11369 states, 11368 states have (on average 1.4649894440534834) internal successors, (16654), 11368 states have internal predecessors, (16654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 16654 transitions. [2025-02-05 19:14:41,968 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 16654 transitions. Word has length 273 [2025-02-05 19:14:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 11369 states and 16654 transitions. [2025-02-05 19:14:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 16654 transitions. [2025-02-05 19:14:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:41,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:41,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 19:14:41,978 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1514090803, now seen corresponding path program 1 times [2025-02-05 19:14:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519581123] [2025-02-05 19:14:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:42,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:42,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:42,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:42,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519581123] [2025-02-05 19:14:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519581123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905294853] [2025-02-05 19:14:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:42,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:42,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:42,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:42,234 INFO L87 Difference]: Start difference. First operand 11369 states and 16654 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:42,448 INFO L93 Difference]: Finished difference Result 14549 states and 21316 transitions. [2025-02-05 19:14:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:42,456 INFO L225 Difference]: With dead ends: 14549 [2025-02-05 19:14:42,456 INFO L226 Difference]: Without dead ends: 11461 [2025-02-05 19:14:42,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:42,460 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 15 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:42,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2025-02-05 19:14:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 11461. [2025-02-05 19:14:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 11460 states have (on average 1.4640488656195463) internal successors, (16778), 11460 states have internal predecessors, (16778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 16778 transitions. [2025-02-05 19:14:42,527 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 16778 transitions. Word has length 273 [2025-02-05 19:14:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 11461 states and 16778 transitions. [2025-02-05 19:14:42,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 16778 transitions. [2025-02-05 19:14:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:42,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:42,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 19:14:42,534 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:42,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash -23102034, now seen corresponding path program 1 times [2025-02-05 19:14:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796820841] [2025-02-05 19:14:42,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:42,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:42,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:42,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796820841] [2025-02-05 19:14:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796820841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25308989] [2025-02-05 19:14:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:42,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:42,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:42,870 INFO L87 Difference]: Start difference. First operand 11461 states and 16778 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:43,104 INFO L93 Difference]: Finished difference Result 14645 states and 21444 transitions. [2025-02-05 19:14:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:43,112 INFO L225 Difference]: With dead ends: 14645 [2025-02-05 19:14:43,112 INFO L226 Difference]: Without dead ends: 11477 [2025-02-05 19:14:43,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:43,115 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:43,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2291 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2025-02-05 19:14:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 11477. [2025-02-05 19:14:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11477 states, 11476 states have (on average 1.463401882188916) internal successors, (16794), 11476 states have internal predecessors, (16794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11477 states to 11477 states and 16794 transitions. [2025-02-05 19:14:43,243 INFO L78 Accepts]: Start accepts. Automaton has 11477 states and 16794 transitions. Word has length 273 [2025-02-05 19:14:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 11477 states and 16794 transitions. [2025-02-05 19:14:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11477 states and 16794 transitions. [2025-02-05 19:14:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:43,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:43,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:43,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 19:14:43,252 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1583063140, now seen corresponding path program 1 times [2025-02-05 19:14:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490398870] [2025-02-05 19:14:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490398870] [2025-02-05 19:14:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490398870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105740320] [2025-02-05 19:14:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:43,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:43,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:43,944 INFO L87 Difference]: Start difference. First operand 11477 states and 16794 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:44,190 INFO L93 Difference]: Finished difference Result 15156 states and 22174 transitions. [2025-02-05 19:14:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:14:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:44,201 INFO L225 Difference]: With dead ends: 15156 [2025-02-05 19:14:44,201 INFO L226 Difference]: Without dead ends: 11924 [2025-02-05 19:14:44,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:44,206 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 131 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:44,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2942 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11924 states. [2025-02-05 19:14:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11924 to 11876. [2025-02-05 19:14:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11876 states, 11875 states have (on average 1.463242105263158) internal successors, (17376), 11875 states have internal predecessors, (17376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11876 states to 11876 states and 17376 transitions. [2025-02-05 19:14:44,293 INFO L78 Accepts]: Start accepts. Automaton has 11876 states and 17376 transitions. Word has length 273 [2025-02-05 19:14:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:44,293 INFO L471 AbstractCegarLoop]: Abstraction has 11876 states and 17376 transitions. [2025-02-05 19:14:44,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11876 states and 17376 transitions. [2025-02-05 19:14:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:44,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 19:14:44,302 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2137652103, now seen corresponding path program 1 times [2025-02-05 19:14:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190359306] [2025-02-05 19:14:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:44,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:44,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190359306] [2025-02-05 19:14:45,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190359306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:45,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:45,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855478041] [2025-02-05 19:14:45,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:45,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:45,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:45,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:45,205 INFO L87 Difference]: Start difference. First operand 11876 states and 17376 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:45,484 INFO L93 Difference]: Finished difference Result 15638 states and 22866 transitions. [2025-02-05 19:14:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:45,492 INFO L225 Difference]: With dead ends: 15638 [2025-02-05 19:14:45,492 INFO L226 Difference]: Without dead ends: 11906 [2025-02-05 19:14:45,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:45,495 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 500 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2898 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:45,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2898 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2025-02-05 19:14:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 11906. [2025-02-05 19:14:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11906 states, 11905 states have (on average 1.4625787484250314) internal successors, (17412), 11905 states have internal predecessors, (17412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11906 states to 11906 states and 17412 transitions. [2025-02-05 19:14:45,563 INFO L78 Accepts]: Start accepts. Automaton has 11906 states and 17412 transitions. Word has length 273 [2025-02-05 19:14:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:45,563 INFO L471 AbstractCegarLoop]: Abstraction has 11906 states and 17412 transitions. [2025-02-05 19:14:45,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 11906 states and 17412 transitions. [2025-02-05 19:14:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:45,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:45,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:45,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 19:14:45,570 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 746038125, now seen corresponding path program 1 times [2025-02-05 19:14:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698960101] [2025-02-05 19:14:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:45,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:45,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:45,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698960101] [2025-02-05 19:14:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698960101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:14:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434871616] [2025-02-05 19:14:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:14:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:45,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:14:45,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:14:45,807 INFO L87 Difference]: Start difference. First operand 11906 states and 17412 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:45,996 INFO L93 Difference]: Finished difference Result 20826 states and 30450 transitions. [2025-02-05 19:14:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:46,007 INFO L225 Difference]: With dead ends: 20826 [2025-02-05 19:14:46,007 INFO L226 Difference]: Without dead ends: 12066 [2025-02-05 19:14:46,013 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-05 19:14:46,013 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:46,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1772 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12066 states. [2025-02-05 19:14:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12066 to 12066. [2025-02-05 19:14:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12066 states, 12065 states have (on average 1.4564442602569416) internal successors, (17572), 12065 states have internal predecessors, (17572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12066 states to 12066 states and 17572 transitions. [2025-02-05 19:14:46,085 INFO L78 Accepts]: Start accepts. Automaton has 12066 states and 17572 transitions. Word has length 273 [2025-02-05 19:14:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:46,085 INFO L471 AbstractCegarLoop]: Abstraction has 12066 states and 17572 transitions. [2025-02-05 19:14:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12066 states and 17572 transitions. [2025-02-05 19:14:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:46,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:46,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 19:14:46,092 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1769148417, now seen corresponding path program 1 times [2025-02-05 19:14:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506000443] [2025-02-05 19:14:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:46,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:46,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:46,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506000443] [2025-02-05 19:14:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506000443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966325132] [2025-02-05 19:14:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:46,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:46,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:46,432 INFO L87 Difference]: Start difference. First operand 12066 states and 17572 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:46,627 INFO L93 Difference]: Finished difference Result 21946 states and 32018 transitions. [2025-02-05 19:14:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:46,636 INFO L225 Difference]: With dead ends: 21946 [2025-02-05 19:14:46,637 INFO L226 Difference]: Without dead ends: 12114 [2025-02-05 19:14:46,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:46,643 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:46,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1768 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12114 states. [2025-02-05 19:14:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12114 to 12114. [2025-02-05 19:14:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12114 states, 12113 states have (on average 1.4546355155617932) internal successors, (17620), 12113 states have internal predecessors, (17620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12114 states to 12114 states and 17620 transitions. [2025-02-05 19:14:46,716 INFO L78 Accepts]: Start accepts. Automaton has 12114 states and 17620 transitions. Word has length 273 [2025-02-05 19:14:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:46,716 INFO L471 AbstractCegarLoop]: Abstraction has 12114 states and 17620 transitions. [2025-02-05 19:14:46,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12114 states and 17620 transitions. [2025-02-05 19:14:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 19:14:46,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:46,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:46,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 19:14:46,723 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1856476966, now seen corresponding path program 1 times [2025-02-05 19:14:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895423316] [2025-02-05 19:14:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:46,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 19:14:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 19:14:46,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895423316] [2025-02-05 19:14:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895423316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57807838] [2025-02-05 19:14:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:46,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:46,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:46,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:46,970 INFO L87 Difference]: Start difference. First operand 12114 states and 17620 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:47,202 INFO L93 Difference]: Finished difference Result 23182 states and 33784 transitions. [2025-02-05 19:14:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 19:14:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:47,212 INFO L225 Difference]: With dead ends: 23182 [2025-02-05 19:14:47,212 INFO L226 Difference]: Without dead ends: 13158 [2025-02-05 19:14:47,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:47,219 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 116 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:47,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13158 states. [2025-02-05 19:14:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13158 to 13158. [2025-02-05 19:14:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13158 states, 13157 states have (on average 1.4536748498897925) internal successors, (19126), 13157 states have internal predecessors, (19126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13158 states to 13158 states and 19126 transitions. [2025-02-05 19:14:47,326 INFO L78 Accepts]: Start accepts. Automaton has 13158 states and 19126 transitions. Word has length 273 [2025-02-05 19:14:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:47,327 INFO L471 AbstractCegarLoop]: Abstraction has 13158 states and 19126 transitions. [2025-02-05 19:14:47,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13158 states and 19126 transitions. [2025-02-05 19:14:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:47,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:47,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 19:14:47,340 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1624067797, now seen corresponding path program 1 times [2025-02-05 19:14:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392739414] [2025-02-05 19:14:47,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:47,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392739414] [2025-02-05 19:14:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392739414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:47,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295865632] [2025-02-05 19:14:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:47,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:47,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:47,640 INFO L87 Difference]: Start difference. First operand 13158 states and 19126 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:47,875 INFO L93 Difference]: Finished difference Result 24702 states and 35928 transitions. [2025-02-05 19:14:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:47,887 INFO L225 Difference]: With dead ends: 24702 [2025-02-05 19:14:47,888 INFO L226 Difference]: Without dead ends: 13206 [2025-02-05 19:14:47,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:47,899 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:47,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2359 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13206 states. [2025-02-05 19:14:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13206 to 13206. [2025-02-05 19:14:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13206 states, 13205 states have (on average 1.4520257478227945) internal successors, (19174), 13205 states have internal predecessors, (19174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13206 states to 13206 states and 19174 transitions. [2025-02-05 19:14:48,002 INFO L78 Accepts]: Start accepts. Automaton has 13206 states and 19174 transitions. Word has length 274 [2025-02-05 19:14:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:48,002 INFO L471 AbstractCegarLoop]: Abstraction has 13206 states and 19174 transitions. [2025-02-05 19:14:48,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 13206 states and 19174 transitions. [2025-02-05 19:14:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:48,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:48,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:48,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 19:14:48,011 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:48,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash 984511768, now seen corresponding path program 1 times [2025-02-05 19:14:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738722595] [2025-02-05 19:14:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:48,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:48,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:48,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738722595] [2025-02-05 19:14:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738722595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973985284] [2025-02-05 19:14:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:48,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:48,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:48,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:48,463 INFO L87 Difference]: Start difference. First operand 13206 states and 19174 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:48,724 INFO L93 Difference]: Finished difference Result 24582 states and 35704 transitions. [2025-02-05 19:14:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:48,743 INFO L225 Difference]: With dead ends: 24582 [2025-02-05 19:14:48,744 INFO L226 Difference]: Without dead ends: 19166 [2025-02-05 19:14:48,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:48,753 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 82 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:48,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19166 states. [2025-02-05 19:14:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19166 to 19166. [2025-02-05 19:14:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19166 states, 19165 states have (on average 1.4504565614401252) internal successors, (27798), 19165 states have internal predecessors, (27798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 27798 transitions. [2025-02-05 19:14:48,949 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 27798 transitions. Word has length 274 [2025-02-05 19:14:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:48,949 INFO L471 AbstractCegarLoop]: Abstraction has 19166 states and 27798 transitions. [2025-02-05 19:14:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 27798 transitions. [2025-02-05 19:14:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:48,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:48,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:48,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 19:14:48,962 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:48,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1545448420, now seen corresponding path program 1 times [2025-02-05 19:14:48,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:48,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643482553] [2025-02-05 19:14:48,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:48,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:49,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:49,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:49,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643482553] [2025-02-05 19:14:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643482553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:49,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954489174] [2025-02-05 19:14:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:49,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:49,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:49,379 INFO L87 Difference]: Start difference. First operand 19166 states and 27798 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:49,633 INFO L93 Difference]: Finished difference Result 24710 states and 35850 transitions. [2025-02-05 19:14:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:49,648 INFO L225 Difference]: With dead ends: 24710 [2025-02-05 19:14:49,648 INFO L226 Difference]: Without dead ends: 19154 [2025-02-05 19:14:49,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:49,655 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 86 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:49,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2025-02-05 19:14:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 19154. [2025-02-05 19:14:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19154 states, 19153 states have (on average 1.450112253954994) internal successors, (27774), 19153 states have internal predecessors, (27774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19154 states to 19154 states and 27774 transitions. [2025-02-05 19:14:49,787 INFO L78 Accepts]: Start accepts. Automaton has 19154 states and 27774 transitions. Word has length 274 [2025-02-05 19:14:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:49,788 INFO L471 AbstractCegarLoop]: Abstraction has 19154 states and 27774 transitions. [2025-02-05 19:14:49,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19154 states and 27774 transitions. [2025-02-05 19:14:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:49,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:49,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 19:14:49,799 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash -630039160, now seen corresponding path program 1 times [2025-02-05 19:14:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203241194] [2025-02-05 19:14:49,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:50,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:50,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:50,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203241194] [2025-02-05 19:14:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203241194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:14:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427196798] [2025-02-05 19:14:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:14:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:50,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:14:50,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:14:50,392 INFO L87 Difference]: Start difference. First operand 19154 states and 27774 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:50,808 INFO L93 Difference]: Finished difference Result 24637 states and 35739 transitions. [2025-02-05 19:14:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:14:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:50,822 INFO L225 Difference]: With dead ends: 24637 [2025-02-05 19:14:50,822 INFO L226 Difference]: Without dead ends: 19192 [2025-02-05 19:14:50,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:50,829 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 94 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:50,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4244 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19192 states. [2025-02-05 19:14:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19192 to 19148. [2025-02-05 19:14:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19148 states, 19147 states have (on average 1.4500966208805557) internal successors, (27765), 19147 states have internal predecessors, (27765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19148 states to 19148 states and 27765 transitions. [2025-02-05 19:14:50,963 INFO L78 Accepts]: Start accepts. Automaton has 19148 states and 27765 transitions. Word has length 274 [2025-02-05 19:14:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:50,963 INFO L471 AbstractCegarLoop]: Abstraction has 19148 states and 27765 transitions. [2025-02-05 19:14:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19148 states and 27765 transitions. [2025-02-05 19:14:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:50,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:50,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:50,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 19:14:50,975 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:50,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1551161162, now seen corresponding path program 1 times [2025-02-05 19:14:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404351340] [2025-02-05 19:14:50,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:51,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:51,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:51,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:51,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404351340] [2025-02-05 19:14:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404351340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262260616] [2025-02-05 19:14:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:51,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:51,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:51,965 INFO L87 Difference]: Start difference. First operand 19148 states and 27765 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:52,388 INFO L93 Difference]: Finished difference Result 24603 states and 35696 transitions. [2025-02-05 19:14:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:52,402 INFO L225 Difference]: With dead ends: 24603 [2025-02-05 19:14:52,403 INFO L226 Difference]: Without dead ends: 19164 [2025-02-05 19:14:52,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:52,411 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 464 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:52,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2539 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19164 states. [2025-02-05 19:14:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19164 to 19160. [2025-02-05 19:14:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19160 states, 19159 states have (on average 1.450023487655932) internal successors, (27781), 19159 states have internal predecessors, (27781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19160 states to 19160 states and 27781 transitions. [2025-02-05 19:14:52,598 INFO L78 Accepts]: Start accepts. Automaton has 19160 states and 27781 transitions. Word has length 274 [2025-02-05 19:14:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:52,598 INFO L471 AbstractCegarLoop]: Abstraction has 19160 states and 27781 transitions. [2025-02-05 19:14:52,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19160 states and 27781 transitions. [2025-02-05 19:14:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:52,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:52,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 19:14:52,610 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash 645142144, now seen corresponding path program 1 times [2025-02-05 19:14:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259080101] [2025-02-05 19:14:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:52,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:52,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:52,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259080101] [2025-02-05 19:14:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259080101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22985477] [2025-02-05 19:14:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:53,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:53,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:53,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:53,087 INFO L87 Difference]: Start difference. First operand 19160 states and 27781 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:53,379 INFO L93 Difference]: Finished difference Result 24986 states and 36216 transitions. [2025-02-05 19:14:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:14:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:53,394 INFO L225 Difference]: With dead ends: 24986 [2025-02-05 19:14:53,395 INFO L226 Difference]: Without dead ends: 19525 [2025-02-05 19:14:53,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:53,402 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 48 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:53,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2939 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19525 states. [2025-02-05 19:14:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19525 to 19483. [2025-02-05 19:14:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19483 states, 19482 states have (on average 1.4483625911097424) internal successors, (28217), 19482 states have internal predecessors, (28217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19483 states to 19483 states and 28217 transitions. [2025-02-05 19:14:53,540 INFO L78 Accepts]: Start accepts. Automaton has 19483 states and 28217 transitions. Word has length 274 [2025-02-05 19:14:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:53,541 INFO L471 AbstractCegarLoop]: Abstraction has 19483 states and 28217 transitions. [2025-02-05 19:14:53,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19483 states and 28217 transitions. [2025-02-05 19:14:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:53,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:53,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:53,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 19:14:53,553 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:53,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2020747433, now seen corresponding path program 1 times [2025-02-05 19:14:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:53,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270835706] [2025-02-05 19:14:53,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:53,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:53,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:53,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:53,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:53,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270835706] [2025-02-05 19:14:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270835706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:53,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112325553] [2025-02-05 19:14:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:53,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:53,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:53,975 INFO L87 Difference]: Start difference. First operand 19483 states and 28217 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:54,270 INFO L93 Difference]: Finished difference Result 25173 states and 36462 transitions. [2025-02-05 19:14:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:54,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:54,297 INFO L225 Difference]: With dead ends: 25173 [2025-02-05 19:14:54,297 INFO L226 Difference]: Without dead ends: 19405 [2025-02-05 19:14:54,305 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-05 19:14:54,305 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 499 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:54,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1562 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:14:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2025-02-05 19:14:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 19405. [2025-02-05 19:14:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19404 states have (on average 1.4484126984126984) internal successors, (28105), 19404 states have internal predecessors, (28105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 28105 transitions. [2025-02-05 19:14:54,434 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 28105 transitions. Word has length 274 [2025-02-05 19:14:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:54,434 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 28105 transitions. [2025-02-05 19:14:54,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 28105 transitions. [2025-02-05 19:14:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:54,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:54,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 19:14:54,446 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1987696285, now seen corresponding path program 1 times [2025-02-05 19:14:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440576138] [2025-02-05 19:14:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:54,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:54,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440576138] [2025-02-05 19:14:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440576138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843071465] [2025-02-05 19:14:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:54,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:54,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:54,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:54,770 INFO L87 Difference]: Start difference. First operand 19405 states and 28105 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:54,995 INFO L93 Difference]: Finished difference Result 26724 states and 38654 transitions. [2025-02-05 19:14:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:55,011 INFO L225 Difference]: With dead ends: 26724 [2025-02-05 19:14:55,011 INFO L226 Difference]: Without dead ends: 19765 [2025-02-05 19:14:55,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:55,019 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 4 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:55,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2025-02-05 19:14:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 19765. [2025-02-05 19:14:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19765 states, 19764 states have (on average 1.4438878769479861) internal successors, (28537), 19764 states have internal predecessors, (28537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19765 states to 19765 states and 28537 transitions. [2025-02-05 19:14:55,147 INFO L78 Accepts]: Start accepts. Automaton has 19765 states and 28537 transitions. Word has length 274 [2025-02-05 19:14:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 19765 states and 28537 transitions. [2025-02-05 19:14:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19765 states and 28537 transitions. [2025-02-05 19:14:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:55,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:55,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 19:14:55,159 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -532927061, now seen corresponding path program 1 times [2025-02-05 19:14:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540882483] [2025-02-05 19:14:55,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:55,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:55,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540882483] [2025-02-05 19:14:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540882483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:55,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:55,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:14:55,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463587335] [2025-02-05 19:14:55,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:55,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:14:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:55,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:14:55,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:55,413 INFO L87 Difference]: Start difference. First operand 19765 states and 28537 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:55,698 INFO L93 Difference]: Finished difference Result 38500 states and 55722 transitions. [2025-02-05 19:14:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:14:55,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:55,717 INFO L225 Difference]: With dead ends: 38500 [2025-02-05 19:14:55,717 INFO L226 Difference]: Without dead ends: 22877 [2025-02-05 19:14:55,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:14:55,730 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 55 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2945 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:55,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2945 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22877 states. [2025-02-05 19:14:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22877 to 22877. [2025-02-05 19:14:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22877 states, 22876 states have (on average 1.4424287462843155) internal successors, (32997), 22876 states have internal predecessors, (32997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22877 states to 22877 states and 32997 transitions. [2025-02-05 19:14:55,889 INFO L78 Accepts]: Start accepts. Automaton has 22877 states and 32997 transitions. Word has length 274 [2025-02-05 19:14:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:55,889 INFO L471 AbstractCegarLoop]: Abstraction has 22877 states and 32997 transitions. [2025-02-05 19:14:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22877 states and 32997 transitions. [2025-02-05 19:14:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:55,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:55,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:55,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 19:14:55,903 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:55,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2099115618, now seen corresponding path program 1 times [2025-02-05 19:14:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904582137] [2025-02-05 19:14:55,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:55,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:55,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:55,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:55,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904582137] [2025-02-05 19:14:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904582137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:14:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514049859] [2025-02-05 19:14:56,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:14:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:56,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:14:56,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:56,184 INFO L87 Difference]: Start difference. First operand 22877 states and 32997 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:56,468 INFO L93 Difference]: Finished difference Result 36604 states and 52798 transitions. [2025-02-05 19:14:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:14:56,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:56,488 INFO L225 Difference]: With dead ends: 36604 [2025-02-05 19:14:56,489 INFO L226 Difference]: Without dead ends: 23037 [2025-02-05 19:14:56,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:14:56,502 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:56,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2287 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:14:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23037 states. [2025-02-05 19:14:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23037 to 23037. [2025-02-05 19:14:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23037 states, 23036 states have (on average 1.4393557909359265) internal successors, (33157), 23036 states have internal predecessors, (33157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23037 states to 23037 states and 33157 transitions. [2025-02-05 19:14:56,714 INFO L78 Accepts]: Start accepts. Automaton has 23037 states and 33157 transitions. Word has length 274 [2025-02-05 19:14:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:56,714 INFO L471 AbstractCegarLoop]: Abstraction has 23037 states and 33157 transitions. [2025-02-05 19:14:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23037 states and 33157 transitions. [2025-02-05 19:14:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 19:14:56,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:56,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 19:14:56,729 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -531954735, now seen corresponding path program 1 times [2025-02-05 19:14:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181530781] [2025-02-05 19:14:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:56,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 19:14:56,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 19:14:56,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:57,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:57,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181530781] [2025-02-05 19:14:57,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181530781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:57,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:14:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283342599] [2025-02-05 19:14:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:57,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:14:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:57,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:14:57,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:57,246 INFO L87 Difference]: Start difference. First operand 23037 states and 33157 transitions. Second operand has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:57,684 INFO L93 Difference]: Finished difference Result 42188 states and 60958 transitions. [2025-02-05 19:14:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:14:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 19:14:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:57,710 INFO L225 Difference]: With dead ends: 42188 [2025-02-05 19:14:57,710 INFO L226 Difference]: Without dead ends: 26733 [2025-02-05 19:14:57,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:14:57,726 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 45 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:57,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4641 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26733 states. [2025-02-05 19:14:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26733 to 26493. [2025-02-05 19:14:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26493 states, 26492 states have (on average 1.4382077608334591) internal successors, (38101), 26492 states have internal predecessors, (38101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 38101 transitions. [2025-02-05 19:14:57,950 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 38101 transitions. Word has length 274 [2025-02-05 19:14:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 26493 states and 38101 transitions. [2025-02-05 19:14:57,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 38101 transitions. [2025-02-05 19:14:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:14:57,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:57,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:57,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 19:14:57,967 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:57,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 805705113, now seen corresponding path program 1 times [2025-02-05 19:14:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:57,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120662495] [2025-02-05 19:14:57,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:57,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:14:58,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:14:58,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120662495] [2025-02-05 19:14:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120662495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:14:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118779326] [2025-02-05 19:14:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:58,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:14:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:58,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:14:58,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:58,475 INFO L87 Difference]: Start difference. First operand 26493 states and 38101 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:14:58,947 INFO L93 Difference]: Finished difference Result 49036 states and 70518 transitions. [2025-02-05 19:14:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:14:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:14:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:14:58,972 INFO L225 Difference]: With dead ends: 49036 [2025-02-05 19:14:58,973 INFO L226 Difference]: Without dead ends: 26733 [2025-02-05 19:14:58,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:14:58,991 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 600 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:14:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2585 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:14:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26733 states. [2025-02-05 19:14:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26733 to 26733. [2025-02-05 19:14:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26733 states, 26732 states have (on average 1.434273529851863) internal successors, (38341), 26732 states have internal predecessors, (38341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26733 states to 26733 states and 38341 transitions. [2025-02-05 19:14:59,281 INFO L78 Accepts]: Start accepts. Automaton has 26733 states and 38341 transitions. Word has length 275 [2025-02-05 19:14:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:14:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 26733 states and 38341 transitions. [2025-02-05 19:14:59,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:14:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26733 states and 38341 transitions. [2025-02-05 19:14:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:14:59,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:14:59,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:14:59,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 19:14:59,302 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:14:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:14:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 848498247, now seen corresponding path program 1 times [2025-02-05 19:14:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:14:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405724387] [2025-02-05 19:14:59,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:14:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:14:59,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:14:59,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:14:59,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:14:59,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:14:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:14:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:14:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405724387] [2025-02-05 19:14:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405724387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:14:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:14:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:14:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200173373] [2025-02-05 19:14:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:14:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:14:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:14:59,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:14:59,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:14:59,915 INFO L87 Difference]: Start difference. First operand 26733 states and 38341 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:00,262 INFO L93 Difference]: Finished difference Result 34214 states and 49076 transitions. [2025-02-05 19:15:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:15:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:00,284 INFO L225 Difference]: With dead ends: 34214 [2025-02-05 19:15:00,284 INFO L226 Difference]: Without dead ends: 26781 [2025-02-05 19:15:00,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:15:00,296 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 2 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:00,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4079 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:15:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26781 states. [2025-02-05 19:15:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26781 to 26781. [2025-02-05 19:15:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26781 states, 26780 states have (on average 1.4339432412247946) internal successors, (38401), 26780 states have internal predecessors, (38401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26781 states to 26781 states and 38401 transitions. [2025-02-05 19:15:00,501 INFO L78 Accepts]: Start accepts. Automaton has 26781 states and 38401 transitions. Word has length 275 [2025-02-05 19:15:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 26781 states and 38401 transitions. [2025-02-05 19:15:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26781 states and 38401 transitions. [2025-02-05 19:15:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:00,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:00,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:00,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 19:15:00,517 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:00,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2134071722, now seen corresponding path program 1 times [2025-02-05 19:15:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500770650] [2025-02-05 19:15:00,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:00,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:00,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:00,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:00,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500770650] [2025-02-05 19:15:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500770650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:15:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996011904] [2025-02-05 19:15:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:00,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:15:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:00,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:15:00,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:15:00,966 INFO L87 Difference]: Start difference. First operand 26781 states and 38401 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:01,337 INFO L93 Difference]: Finished difference Result 34086 states and 48893 transitions. [2025-02-05 19:15:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:15:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:01,360 INFO L225 Difference]: With dead ends: 34086 [2025-02-05 19:15:01,361 INFO L226 Difference]: Without dead ends: 26827 [2025-02-05 19:15:01,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:15:01,372 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 35 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:01,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3543 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:15:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2025-02-05 19:15:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 26827. [2025-02-05 19:15:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26827 states, 26826 states have (on average 1.4337955714605233) internal successors, (38463), 26826 states have internal predecessors, (38463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26827 states to 26827 states and 38463 transitions. [2025-02-05 19:15:01,662 INFO L78 Accepts]: Start accepts. Automaton has 26827 states and 38463 transitions. Word has length 275 [2025-02-05 19:15:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:01,662 INFO L471 AbstractCegarLoop]: Abstraction has 26827 states and 38463 transitions. [2025-02-05 19:15:01,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26827 states and 38463 transitions. [2025-02-05 19:15:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:01,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:01,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:01,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 19:15:01,679 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:01,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 353204638, now seen corresponding path program 1 times [2025-02-05 19:15:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495998615] [2025-02-05 19:15:01,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:01,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:01,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495998615] [2025-02-05 19:15:01,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495998615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:01,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:15:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081922647] [2025-02-05 19:15:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:15:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:01,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:15:01,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:01,986 INFO L87 Difference]: Start difference. First operand 26827 states and 38463 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:02,251 INFO L93 Difference]: Finished difference Result 42376 states and 60994 transitions. [2025-02-05 19:15:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:02,285 INFO L225 Difference]: With dead ends: 42376 [2025-02-05 19:15:02,285 INFO L226 Difference]: Without dead ends: 33323 [2025-02-05 19:15:02,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:02,300 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 46 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:02,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2358 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33323 states. [2025-02-05 19:15:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33323 to 33323. [2025-02-05 19:15:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33323 states, 33322 states have (on average 1.4385391032951202) internal successors, (47935), 33322 states have internal predecessors, (47935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33323 states to 33323 states and 47935 transitions. [2025-02-05 19:15:02,552 INFO L78 Accepts]: Start accepts. Automaton has 33323 states and 47935 transitions. Word has length 275 [2025-02-05 19:15:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:02,552 INFO L471 AbstractCegarLoop]: Abstraction has 33323 states and 47935 transitions. [2025-02-05 19:15:02,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 33323 states and 47935 transitions. [2025-02-05 19:15:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:02,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:02,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 19:15:02,575 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:02,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -684734428, now seen corresponding path program 1 times [2025-02-05 19:15:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502074578] [2025-02-05 19:15:02,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:02,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:02,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:02,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:02,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502074578] [2025-02-05 19:15:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502074578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:02,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859986504] [2025-02-05 19:15:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:02,873 INFO L87 Difference]: Start difference. First operand 33323 states and 47935 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:03,148 INFO L93 Difference]: Finished difference Result 55736 states and 80162 transitions. [2025-02-05 19:15:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:03,182 INFO L225 Difference]: With dead ends: 55736 [2025-02-05 19:15:03,182 INFO L226 Difference]: Without dead ends: 36683 [2025-02-05 19:15:03,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:03,203 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 16 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:03,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2025-02-05 19:15:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 36683. [2025-02-05 19:15:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36683 states, 36682 states have (on average 1.4310833651382149) internal successors, (52495), 36682 states have internal predecessors, (52495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36683 states to 36683 states and 52495 transitions. [2025-02-05 19:15:03,496 INFO L78 Accepts]: Start accepts. Automaton has 36683 states and 52495 transitions. Word has length 275 [2025-02-05 19:15:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:03,496 INFO L471 AbstractCegarLoop]: Abstraction has 36683 states and 52495 transitions. [2025-02-05 19:15:03,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36683 states and 52495 transitions. [2025-02-05 19:15:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:03,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:03,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:03,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 19:15:03,522 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:03,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash 711854330, now seen corresponding path program 1 times [2025-02-05 19:15:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:03,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012833792] [2025-02-05 19:15:03,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:03,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:03,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012833792] [2025-02-05 19:15:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012833792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057177658] [2025-02-05 19:15:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:03,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:03,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:03,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:03,864 INFO L87 Difference]: Start difference. First operand 36683 states and 52495 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:04,126 INFO L93 Difference]: Finished difference Result 71736 states and 102658 transitions. [2025-02-05 19:15:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:04,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:04,161 INFO L225 Difference]: With dead ends: 71736 [2025-02-05 19:15:04,161 INFO L226 Difference]: Without dead ends: 36779 [2025-02-05 19:15:04,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:04,187 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1771 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-05 19:15:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1771 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-02-05 19:15:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-02-05 19:15:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4299581271412258) internal successors, (52591), 36778 states have internal predecessors, (52591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52591 transitions. [2025-02-05 19:15:04,477 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52591 transitions. Word has length 275 [2025-02-05 19:15:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:04,477 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52591 transitions. [2025-02-05 19:15:04,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52591 transitions. [2025-02-05 19:15:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:04,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:04,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 19:15:04,501 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 463547398, now seen corresponding path program 1 times [2025-02-05 19:15:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66460905] [2025-02-05 19:15:04,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:04,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:05,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:05,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:05,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:05,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66460905] [2025-02-05 19:15:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66460905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:05,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:15:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077767957] [2025-02-05 19:15:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:05,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:15:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:05,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:15:05,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:05,712 INFO L87 Difference]: Start difference. First operand 36779 states and 52591 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:06,084 INFO L93 Difference]: Finished difference Result 67048 states and 96026 transitions. [2025-02-05 19:15:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:15:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:06,119 INFO L225 Difference]: With dead ends: 67048 [2025-02-05 19:15:06,120 INFO L226 Difference]: Without dead ends: 36779 [2025-02-05 19:15:06,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:15:06,143 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 146 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:06,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2906 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:15:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-02-05 19:15:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-02-05 19:15:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4295230844526619) internal successors, (52575), 36778 states have internal predecessors, (52575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52575 transitions. [2025-02-05 19:15:06,506 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52575 transitions. Word has length 275 [2025-02-05 19:15:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:06,506 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52575 transitions. [2025-02-05 19:15:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52575 transitions. [2025-02-05 19:15:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 19:15:06,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:06,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:06,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 19:15:06,531 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:06,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -612554777, now seen corresponding path program 1 times [2025-02-05 19:15:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513999220] [2025-02-05 19:15:06,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:06,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 19:15:06,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 19:15:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:07,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513999220] [2025-02-05 19:15:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513999220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511438433] [2025-02-05 19:15:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:07,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:07,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:07,095 INFO L87 Difference]: Start difference. First operand 36779 states and 52575 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:07,484 INFO L93 Difference]: Finished difference Result 72844 states and 104128 transitions. [2025-02-05 19:15:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:07,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 19:15:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:07,518 INFO L225 Difference]: With dead ends: 72844 [2025-02-05 19:15:07,519 INFO L226 Difference]: Without dead ends: 36779 [2025-02-05 19:15:07,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:07,546 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 17 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:07,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2126 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:15:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-02-05 19:15:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-02-05 19:15:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4294958942846268) internal successors, (52574), 36778 states have internal predecessors, (52574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52574 transitions. [2025-02-05 19:15:07,837 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52574 transitions. Word has length 275 [2025-02-05 19:15:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:07,838 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52574 transitions. [2025-02-05 19:15:07,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52574 transitions. [2025-02-05 19:15:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:07,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:07,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 19:15:07,863 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1756211398, now seen corresponding path program 1 times [2025-02-05 19:15:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621051266] [2025-02-05 19:15:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:08,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:08,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:08,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621051266] [2025-02-05 19:15:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621051266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:15:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063254713] [2025-02-05 19:15:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:09,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:15:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:09,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:15:09,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:15:09,013 INFO L87 Difference]: Start difference. First operand 36779 states and 52574 transitions. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:09,610 INFO L93 Difference]: Finished difference Result 53272 states and 76305 transitions. [2025-02-05 19:15:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:15:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-05 19:15:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:09,645 INFO L225 Difference]: With dead ends: 53272 [2025-02-05 19:15:09,645 INFO L226 Difference]: Without dead ends: 36779 [2025-02-05 19:15:09,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:15:09,665 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 382 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:09,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 3178 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:15:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-02-05 19:15:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-02-05 19:15:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4260155527761162) internal successors, (52446), 36778 states have internal predecessors, (52446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52446 transitions. [2025-02-05 19:15:09,972 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52446 transitions. Word has length 276 [2025-02-05 19:15:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:09,972 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52446 transitions. [2025-02-05 19:15:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52446 transitions. [2025-02-05 19:15:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:09,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:09,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:09,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 19:15:09,999 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:09,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash -484443557, now seen corresponding path program 1 times [2025-02-05 19:15:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296667692] [2025-02-05 19:15:09,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:10,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:10,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:10,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:10,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296667692] [2025-02-05 19:15:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296667692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:10,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523815942] [2025-02-05 19:15:10,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:10,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:10,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:10,273 INFO L87 Difference]: Start difference. First operand 36779 states and 52446 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:10,502 INFO L93 Difference]: Finished difference Result 46716 states and 66691 transitions. [2025-02-05 19:15:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-05 19:15:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:10,540 INFO L225 Difference]: With dead ends: 46716 [2025-02-05 19:15:10,540 INFO L226 Difference]: Without dead ends: 36905 [2025-02-05 19:15:10,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:10,556 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 12 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:10,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36905 states. [2025-02-05 19:15:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36905 to 36905. [2025-02-05 19:15:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36905 states, 36904 states have (on average 1.4256991112074573) internal successors, (52614), 36904 states have internal predecessors, (52614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36905 states to 36905 states and 52614 transitions. [2025-02-05 19:15:10,832 INFO L78 Accepts]: Start accepts. Automaton has 36905 states and 52614 transitions. Word has length 276 [2025-02-05 19:15:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:10,832 INFO L471 AbstractCegarLoop]: Abstraction has 36905 states and 52614 transitions. [2025-02-05 19:15:10,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36905 states and 52614 transitions. [2025-02-05 19:15:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:10,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:10,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:10,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-05 19:15:10,857 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash 475927190, now seen corresponding path program 1 times [2025-02-05 19:15:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955384545] [2025-02-05 19:15:10,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:10,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:10,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:10,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955384545] [2025-02-05 19:15:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955384545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995310574] [2025-02-05 19:15:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:11,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:11,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:11,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:11,104 INFO L87 Difference]: Start difference. First operand 36905 states and 52614 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:11,406 INFO L93 Difference]: Finished difference Result 78582 states and 112173 transitions. [2025-02-05 19:15:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-05 19:15:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:11,473 INFO L225 Difference]: With dead ends: 78582 [2025-02-05 19:15:11,474 INFO L226 Difference]: Without dead ends: 68677 [2025-02-05 19:15:11,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:11,499 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 192 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:11,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 2355 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68677 states. [2025-02-05 19:15:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68677 to 68677. [2025-02-05 19:15:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68677 states, 68676 states have (on average 1.426349816529792) internal successors, (97956), 68676 states have internal predecessors, (97956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68677 states to 68677 states and 97956 transitions. [2025-02-05 19:15:12,152 INFO L78 Accepts]: Start accepts. Automaton has 68677 states and 97956 transitions. Word has length 276 [2025-02-05 19:15:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:12,153 INFO L471 AbstractCegarLoop]: Abstraction has 68677 states and 97956 transitions. [2025-02-05 19:15:12,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 68677 states and 97956 transitions. [2025-02-05 19:15:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:12,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:12,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-05 19:15:12,202 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -25753583, now seen corresponding path program 1 times [2025-02-05 19:15:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240792077] [2025-02-05 19:15:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:12,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:12,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240792077] [2025-02-05 19:15:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240792077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:12,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295949043] [2025-02-05 19:15:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:12,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:12,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:12,529 INFO L87 Difference]: Start difference. First operand 68677 states and 97956 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:12,830 INFO L93 Difference]: Finished difference Result 86162 states and 123089 transitions. [2025-02-05 19:15:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-05 19:15:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:12,897 INFO L225 Difference]: With dead ends: 86162 [2025-02-05 19:15:12,897 INFO L226 Difference]: Without dead ends: 68725 [2025-02-05 19:15:12,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:12,927 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1771 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-05 19:15:12,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1771 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68725 states. [2025-02-05 19:15:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68725 to 68725. [2025-02-05 19:15:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68725 states, 68724 states have (on average 1.4260520342238518) internal successors, (98004), 68724 states have internal predecessors, (98004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68725 states to 68725 states and 98004 transitions. [2025-02-05 19:15:13,532 INFO L78 Accepts]: Start accepts. Automaton has 68725 states and 98004 transitions. Word has length 276 [2025-02-05 19:15:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 68725 states and 98004 transitions. [2025-02-05 19:15:13,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68725 states and 98004 transitions. [2025-02-05 19:15:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:13,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:13,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-05 19:15:13,580 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:13,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 726039161, now seen corresponding path program 1 times [2025-02-05 19:15:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218186039] [2025-02-05 19:15:13,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218186039] [2025-02-05 19:15:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218186039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:15:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983232171] [2025-02-05 19:15:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:15:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:14,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:15:14,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:15:14,134 INFO L87 Difference]: Start difference. First operand 68725 states and 98004 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:14,599 INFO L93 Difference]: Finished difference Result 109388 states and 155841 transitions. [2025-02-05 19:15:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:15:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-05 19:15:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:14,642 INFO L225 Difference]: With dead ends: 109388 [2025-02-05 19:15:14,642 INFO L226 Difference]: Without dead ends: 46453 [2025-02-05 19:15:14,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-05 19:15:14,681 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 456 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 2898 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:14,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 2898 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:15:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46453 states. [2025-02-05 19:15:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46453 to 45749. [2025-02-05 19:15:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45749 states, 45748 states have (on average 1.410597184576375) internal successors, (64532), 45748 states have internal predecessors, (64532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45749 states to 45749 states and 64532 transitions. [2025-02-05 19:15:15,040 INFO L78 Accepts]: Start accepts. Automaton has 45749 states and 64532 transitions. Word has length 276 [2025-02-05 19:15:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 45749 states and 64532 transitions. [2025-02-05 19:15:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 45749 states and 64532 transitions. [2025-02-05 19:15:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 19:15:15,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:15,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:15,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-05 19:15:15,067 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1767680959, now seen corresponding path program 1 times [2025-02-05 19:15:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096633968] [2025-02-05 19:15:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 19:15:15,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 19:15:15,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096633968] [2025-02-05 19:15:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096633968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:16,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 19:15:16,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684964809] [2025-02-05 19:15:16,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:16,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 19:15:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:16,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 19:15:16,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2025-02-05 19:15:16,494 INFO L87 Difference]: Start difference. First operand 45749 states and 64532 transitions. Second operand has 19 states, 19 states have (on average 14.526315789473685) internal successors, (276), 19 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)