./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.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 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:05:18,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:05:18,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:05:18,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:05:18,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:05:18,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:05:18,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:05:18,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:05:18,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:05:18,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:05:18,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:05:18,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:05:18,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:05:18,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:05:18,919 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:05:18,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:05:18,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:05:18,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:05:18,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:05:18,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:05:18,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:05:18,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:05:18,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:05:18,922 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 -> 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd [2025-02-07 22:05:19,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:05:19,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:05:19,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:05:19,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:05:19,151 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:05:19,152 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.Huffman_dec.c [2025-02-07 22:05:20,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab9ce4be/2dbf4e5e0a0d4e57b61327aa6327d69e/FLAG9527e0f64 [2025-02-07 22:05:20,592 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:05:20,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c [2025-02-07 22:05:20,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab9ce4be/2dbf4e5e0a0d4e57b61327aa6327d69e/FLAG9527e0f64 [2025-02-07 22:05:20,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab9ce4be/2dbf4e5e0a0d4e57b61327aa6327d69e [2025-02-07 22:05:20,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:05:20,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:05:20,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:05:20,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:05:20,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:05:20,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:05:20" (1/1) ... [2025-02-07 22:05:20,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:20, skipping insertion in model container [2025-02-07 22:05:20,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:05:20" (1/1) ... [2025-02-07 22:05:20,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:05:21,045 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.Huffman_dec.c[1251,1264] [2025-02-07 22:05:21,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:05:21,210 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:05:21,219 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.Huffman_dec.c[1251,1264] [2025-02-07 22:05:21,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:05:21,308 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:05:21,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21 WrapperNode [2025-02-07 22:05:21,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:05:21,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:05:21,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:05:21,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:05:21,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,415 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1334 [2025-02-07 22:05:21,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:05:21,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:05:21,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:05:21,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:05:21,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,476 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 22:05:21,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:05:21,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:05:21,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:05:21,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:05:21,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (1/1) ... [2025-02-07 22:05:21,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:05:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:05:21,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:05:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:05:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:05:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:05:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:05:21,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:05:21,849 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:05:21,854 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:05:23,099 INFO L? ?]: Removed 789 outVars from TransFormulas that were not future-live. [2025-02-07 22:05:23,100 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:05:23,145 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:05:23,145 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:05:23,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:05:23 BoogieIcfgContainer [2025-02-07 22:05:23,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:05:23,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:05:23,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:05:23,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:05:23,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:05:20" (1/3) ... [2025-02-07 22:05:23,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f55021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:05:23, skipping insertion in model container [2025-02-07 22:05:23,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:21" (2/3) ... [2025-02-07 22:05:23,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f55021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:05:23, skipping insertion in model container [2025-02-07 22:05:23,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:05:23" (3/3) ... [2025-02-07 22:05:23,152 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Huffman_dec.c [2025-02-07 22:05:23,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:05:23,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.Huffman_dec.c that has 1 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:05:23,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:05:23,206 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;@7d248223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:05:23,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:05:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 286 states have (on average 1.5) internal successors, (429), 287 states have internal predecessors, (429), 0 states have call successors, (0), 0 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-07 22:05:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 22:05:23,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:23,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:23,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1656108588, now seen corresponding path program 1 times [2025-02-07 22:05:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:23,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743794577] [2025-02-07 22:05:23,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:23,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 22:05:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 22:05:23,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:23,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:24,490 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-07 22:05:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743794577] [2025-02-07 22:05:24,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743794577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:24,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623898391] [2025-02-07 22:05:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:24,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:24,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:24,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:24,515 INFO L87 Difference]: Start difference. First operand has 288 states, 286 states have (on average 1.5) internal successors, (429), 287 states have internal predecessors, (429), 0 states have call successors, (0), 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 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-07 22:05:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:24,695 INFO L93 Difference]: Finished difference Result 567 states and 847 transitions. [2025-02-07 22:05:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-07 22:05:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:24,701 INFO L225 Difference]: With dead ends: 567 [2025-02-07 22:05:24,701 INFO L226 Difference]: Without dead ends: 288 [2025-02-07 22:05:24,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:24,705 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:24,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:05:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-07 22:05:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-02-07 22:05:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4912891986062717) internal successors, (428), 287 states have internal predecessors, (428), 0 states have call successors, (0), 0 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-07 22:05:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2025-02-07 22:05:24,734 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 70 [2025-02-07 22:05:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:24,735 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2025-02-07 22:05:24,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-07 22:05:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2025-02-07 22:05:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 22:05:24,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:24,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:24,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:05:24,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:24,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 204920726, now seen corresponding path program 1 times [2025-02-07 22:05:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342943762] [2025-02-07 22:05:24,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:24,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 22:05:24,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 22:05:24,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:25,105 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-07 22:05:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342943762] [2025-02-07 22:05:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342943762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943486047] [2025-02-07 22:05:25,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:25,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:25,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:25,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:25,108 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-07 22:05:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:25,457 INFO L93 Difference]: Finished difference Result 569 states and 846 transitions. [2025-02-07 22:05:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:25,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-07 22:05:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:25,459 INFO L225 Difference]: With dead ends: 569 [2025-02-07 22:05:25,460 INFO L226 Difference]: Without dead ends: 290 [2025-02-07 22:05:25,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:25,461 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:25,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1054 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-07 22:05:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-07 22:05:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.4878892733564013) internal successors, (430), 289 states have internal predecessors, (430), 0 states have call successors, (0), 0 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-07 22:05:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 430 transitions. [2025-02-07 22:05:25,475 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 430 transitions. Word has length 71 [2025-02-07 22:05:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:25,477 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 430 transitions. [2025-02-07 22:05:25,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-07 22:05:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 430 transitions. [2025-02-07 22:05:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 22:05:25,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:25,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:05:25,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -305882609, now seen corresponding path program 1 times [2025-02-07 22:05:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954562245] [2025-02-07 22:05:25,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:25,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 22:05:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 22:05:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:26,511 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-07 22:05:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954562245] [2025-02-07 22:05:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954562245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:26,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:26,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350366959] [2025-02-07 22:05:26,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:26,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:26,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:26,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:26,512 INFO L87 Difference]: Start difference. First operand 290 states and 430 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-07 22:05:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:26,686 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2025-02-07 22:05:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:05:26,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-07 22:05:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:26,687 INFO L225 Difference]: With dead ends: 575 [2025-02-07 22:05:26,687 INFO L226 Difference]: Without dead ends: 294 [2025-02-07 22:05:26,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-07 22:05:26,688 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 369 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:26,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1050 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:05:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-07 22:05:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2025-02-07 22:05:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4863013698630136) internal successors, (434), 292 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-07 22:05:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 434 transitions. [2025-02-07 22:05:26,732 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 434 transitions. Word has length 72 [2025-02-07 22:05:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:26,732 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 434 transitions. [2025-02-07 22:05:26,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-07 22:05:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 434 transitions. [2025-02-07 22:05:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 22:05:26,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:26,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:05:26,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 671152892, now seen corresponding path program 1 times [2025-02-07 22:05:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233785250] [2025-02-07 22:05:26,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 22:05:26,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 22:05:26,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:26,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:27,458 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-07 22:05:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233785250] [2025-02-07 22:05:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233785250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:27,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010992014] [2025-02-07 22:05:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:27,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:27,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:27,460 INFO L87 Difference]: Start difference. First operand 293 states and 434 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-07 22:05:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:27,746 INFO L93 Difference]: Finished difference Result 576 states and 854 transitions. [2025-02-07 22:05:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:05:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-02-07 22:05:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:27,747 INFO L225 Difference]: With dead ends: 576 [2025-02-07 22:05:27,748 INFO L226 Difference]: Without dead ends: 292 [2025-02-07 22:05:27,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:05:27,748 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 365 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:27,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1054 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-07 22:05:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-07 22:05:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4845360824742269) internal successors, (432), 291 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-07 22:05:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 432 transitions. [2025-02-07 22:05:27,755 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 432 transitions. Word has length 73 [2025-02-07 22:05:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:27,755 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 432 transitions. [2025-02-07 22:05:27,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-07 22:05:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 432 transitions. [2025-02-07 22:05:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 22:05:27,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:27,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:27,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:05:27,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 995936475, now seen corresponding path program 1 times [2025-02-07 22:05:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:27,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954654604] [2025-02-07 22:05:27,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:27,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 22:05:28,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 22:05:28,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:28,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:34,823 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-07 22:05:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:34,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954654604] [2025-02-07 22:05:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954654604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:34,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970492532] [2025-02-07 22:05:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:34,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:34,825 INFO L87 Difference]: Start difference. First operand 292 states and 432 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-07 22:05:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:35,733 INFO L93 Difference]: Finished difference Result 575 states and 851 transitions. [2025-02-07 22:05:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-02-07 22:05:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:35,735 INFO L225 Difference]: With dead ends: 575 [2025-02-07 22:05:35,735 INFO L226 Difference]: Without dead ends: 292 [2025-02-07 22:05:35,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:05:35,740 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 366 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:35,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 408 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:05:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-07 22:05:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-07 22:05:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4810996563573884) internal successors, (431), 291 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-07 22:05:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 431 transitions. [2025-02-07 22:05:35,750 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 431 transitions. Word has length 73 [2025-02-07 22:05:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:35,751 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 431 transitions. [2025-02-07 22:05:35,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-07 22:05:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 431 transitions. [2025-02-07 22:05:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 22:05:35,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:35,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:35,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:05:35,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:35,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1291102506, now seen corresponding path program 1 times [2025-02-07 22:05:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976893943] [2025-02-07 22:05:35,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:35,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 22:05:36,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 22:05:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:53,091 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-07 22:05:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:53,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976893943] [2025-02-07 22:05:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976893943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2025-02-07 22:05:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021159987] [2025-02-07 22:05:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-07 22:05:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:53,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-07 22:05:53,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=3054, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 22:05:53,094 INFO L87 Difference]: Start difference. First operand 292 states and 431 transitions. Second operand has 57 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-07 22:06:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:04,893 INFO L93 Difference]: Finished difference Result 2007 states and 2984 transitions. [2025-02-07 22:06:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-07 22:06:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 22:06:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:04,926 INFO L225 Difference]: With dead ends: 2007 [2025-02-07 22:06:04,927 INFO L226 Difference]: Without dead ends: 1724 [2025-02-07 22:06:04,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1702, Invalid=10288, Unknown=0, NotChecked=0, Total=11990 [2025-02-07 22:06:04,933 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 7279 mSDsluCounter, 16701 mSDsCounter, 0 mSdLazyCounter, 6548 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7279 SdHoareTripleChecker+Valid, 17020 SdHoareTripleChecker+Invalid, 6548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:04,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7279 Valid, 17020 Invalid, 6548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6548 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-07 22:06:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2025-02-07 22:06:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 346. [2025-02-07 22:06:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.481159420289855) internal successors, (511), 345 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-07 22:06:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 511 transitions. [2025-02-07 22:06:04,966 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 511 transitions. Word has length 74 [2025-02-07 22:06:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:04,966 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 511 transitions. [2025-02-07 22:06:04,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-07 22:06:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 511 transitions. [2025-02-07 22:06:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:04,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:04,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:04,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:06:04,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:04,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -492237020, now seen corresponding path program 1 times [2025-02-07 22:06:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:04,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347638922] [2025-02-07 22:06:04,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:05,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:05,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:05,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:05,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:05,314 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-07 22:06:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347638922] [2025-02-07 22:06:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347638922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206663534] [2025-02-07 22:06:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:05,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:05,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:05,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:05,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:05,316 INFO L87 Difference]: Start difference. First operand 346 states and 511 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:05,922 INFO L93 Difference]: Finished difference Result 876 states and 1291 transitions. [2025-02-07 22:06:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:05,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:05,927 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:05,927 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:05,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:05,928 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 807 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:05,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:06:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 359. [2025-02-07 22:06:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4804469273743017) internal successors, (530), 358 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-07 22:06:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 530 transitions. [2025-02-07 22:06:05,946 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 530 transitions. Word has length 75 [2025-02-07 22:06:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:05,946 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 530 transitions. [2025-02-07 22:06:05,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 530 transitions. [2025-02-07 22:06:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:05,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:05,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:06:05,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:05,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash -810462037, now seen corresponding path program 1 times [2025-02-07 22:06:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:05,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798516792] [2025-02-07 22:06:05,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:06,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:06,294 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-07 22:06:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798516792] [2025-02-07 22:06:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798516792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458040006] [2025-02-07 22:06:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:06,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:06,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:06,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:06,296 INFO L87 Difference]: Start difference. First operand 359 states and 530 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:06,809 INFO L93 Difference]: Finished difference Result 876 states and 1290 transitions. [2025-02-07 22:06:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:06,811 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:06,811 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:06,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:06,812 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 795 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:06,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 389. [2025-02-07 22:06:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 22:06:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 574 transitions. [2025-02-07 22:06:06,820 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 574 transitions. Word has length 75 [2025-02-07 22:06:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 574 transitions. [2025-02-07 22:06:06,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2025-02-07 22:06:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:06,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:06,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:06,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:06:06,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:06,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -38112735, now seen corresponding path program 1 times [2025-02-07 22:06:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158158043] [2025-02-07 22:06:06,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:06,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:06,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:06,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:06,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:07,072 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-07 22:06:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158158043] [2025-02-07 22:06:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158158043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309717629] [2025-02-07 22:06:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:07,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:07,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:07,074 INFO L87 Difference]: Start difference. First operand 389 states and 574 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:07,587 INFO L93 Difference]: Finished difference Result 876 states and 1289 transitions. [2025-02-07 22:06:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:07,597 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:07,597 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:07,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:07,601 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 789 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:07,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2025-02-07 22:06:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 0 states have call successors, (0), 0 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-07 22:06:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 591 transitions. [2025-02-07 22:06:07,625 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 591 transitions. Word has length 75 [2025-02-07 22:06:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:07,628 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 591 transitions. [2025-02-07 22:06:07,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 591 transitions. [2025-02-07 22:06:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:07,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:07,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:07,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:06:07,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:07,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash -710362473, now seen corresponding path program 1 times [2025-02-07 22:06:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037809435] [2025-02-07 22:06:07,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:07,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:07,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:07,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:07,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:08,011 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-07 22:06:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037809435] [2025-02-07 22:06:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037809435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134967421] [2025-02-07 22:06:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:08,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:08,013 INFO L87 Difference]: Start difference. First operand 401 states and 591 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:08,514 INFO L93 Difference]: Finished difference Result 876 states and 1288 transitions. [2025-02-07 22:06:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:08,516 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:08,516 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:08,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:08,517 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 783 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:08,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 413. [2025-02-07 22:06:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4757281553398058) internal successors, (608), 412 states have internal predecessors, (608), 0 states have call successors, (0), 0 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-07 22:06:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 608 transitions. [2025-02-07 22:06:08,527 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 608 transitions. Word has length 75 [2025-02-07 22:06:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:08,527 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 608 transitions. [2025-02-07 22:06:08,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2025-02-07 22:06:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:08,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:08,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:06:08,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash -199744546, now seen corresponding path program 1 times [2025-02-07 22:06:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489274044] [2025-02-07 22:06:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:08,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:08,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:08,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:08,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:08,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-07 22:06:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489274044] [2025-02-07 22:06:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489274044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090137482] [2025-02-07 22:06:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:08,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:08,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:08,796 INFO L87 Difference]: Start difference. First operand 413 states and 608 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:09,198 INFO L93 Difference]: Finished difference Result 876 states and 1287 transitions. [2025-02-07 22:06:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:09,200 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:09,200 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:09,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:09,201 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 771 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:09,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 443. [2025-02-07 22:06:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.4751131221719458) internal successors, (652), 442 states have internal predecessors, (652), 0 states have call successors, (0), 0 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-07 22:06:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 652 transitions. [2025-02-07 22:06:09,214 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 652 transitions. Word has length 75 [2025-02-07 22:06:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:09,214 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 652 transitions. [2025-02-07 22:06:09,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 652 transitions. [2025-02-07 22:06:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:09,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:09,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:09,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:06:09,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 225891028, now seen corresponding path program 1 times [2025-02-07 22:06:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220723633] [2025-02-07 22:06:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:09,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:09,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:09,478 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-07 22:06:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220723633] [2025-02-07 22:06:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220723633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:09,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463857901] [2025-02-07 22:06:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:09,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:09,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:09,480 INFO L87 Difference]: Start difference. First operand 443 states and 652 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:09,902 INFO L93 Difference]: Finished difference Result 876 states and 1286 transitions. [2025-02-07 22:06:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:09,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:09,907 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:09,907 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:09,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:09,908 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 765 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:09,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 455. [2025-02-07 22:06:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.473568281938326) internal successors, (669), 454 states have internal predecessors, (669), 0 states have call successors, (0), 0 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-07 22:06:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 669 transitions. [2025-02-07 22:06:09,916 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 669 transitions. Word has length 75 [2025-02-07 22:06:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:09,916 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 669 transitions. [2025-02-07 22:06:09,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 669 transitions. [2025-02-07 22:06:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:09,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:09,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:06:09,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -293669797, now seen corresponding path program 1 times [2025-02-07 22:06:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809832763] [2025-02-07 22:06:09,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:10,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:10,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:10,217 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-07 22:06:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:10,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809832763] [2025-02-07 22:06:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809832763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:10,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989460346] [2025-02-07 22:06:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:10,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:10,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:10,218 INFO L87 Difference]: Start difference. First operand 455 states and 669 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:10,716 INFO L93 Difference]: Finished difference Result 876 states and 1285 transitions. [2025-02-07 22:06:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:10,719 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:10,719 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:10,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:10,720 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 753 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:10,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 485. [2025-02-07 22:06:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.4731404958677685) internal successors, (713), 484 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-07 22:06:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 713 transitions. [2025-02-07 22:06:10,740 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 713 transitions. Word has length 75 [2025-02-07 22:06:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 713 transitions. [2025-02-07 22:06:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 713 transitions. [2025-02-07 22:06:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:10,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:10,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:06:10,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 841705937, now seen corresponding path program 1 times [2025-02-07 22:06:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851248226] [2025-02-07 22:06:10,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:10,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:11,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:11,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:11,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:11,316 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-07 22:06:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851248226] [2025-02-07 22:06:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851248226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966984466] [2025-02-07 22:06:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:11,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:11,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:11,318 INFO L87 Difference]: Start difference. First operand 485 states and 713 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:11,840 INFO L93 Difference]: Finished difference Result 876 states and 1284 transitions. [2025-02-07 22:06:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:11,842 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:11,842 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:11,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:11,843 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 747 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:11,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 497. [2025-02-07 22:06:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.471774193548387) internal successors, (730), 496 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-07 22:06:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 730 transitions. [2025-02-07 22:06:11,853 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 730 transitions. Word has length 75 [2025-02-07 22:06:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 730 transitions. [2025-02-07 22:06:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 730 transitions. [2025-02-07 22:06:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:11,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:11,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:06:11,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1730742855, now seen corresponding path program 1 times [2025-02-07 22:06:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132623280] [2025-02-07 22:06:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:11,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:12,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:12,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:12,383 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-07 22:06:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132623280] [2025-02-07 22:06:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132623280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:12,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245186637] [2025-02-07 22:06:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:12,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:12,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:12,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:12,384 INFO L87 Difference]: Start difference. First operand 497 states and 730 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:12,982 INFO L93 Difference]: Finished difference Result 876 states and 1283 transitions. [2025-02-07 22:06:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:12,984 INFO L225 Difference]: With dead ends: 876 [2025-02-07 22:06:12,984 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:12,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:12,984 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 741 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:12,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:06:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.470472440944882) internal successors, (747), 508 states have internal predecessors, (747), 0 states have call successors, (0), 0 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-07 22:06:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 747 transitions. [2025-02-07 22:06:13,000 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 747 transitions. Word has length 75 [2025-02-07 22:06:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:13,000 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 747 transitions. [2025-02-07 22:06:13,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 747 transitions. [2025-02-07 22:06:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:13,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:06:13,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:13,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash 899398828, now seen corresponding path program 1 times [2025-02-07 22:06:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:13,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632433065] [2025-02-07 22:06:13,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:13,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:13,325 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-07 22:06:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632433065] [2025-02-07 22:06:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632433065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:13,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:13,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:13,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131250270] [2025-02-07 22:06:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:13,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:13,329 INFO L87 Difference]: Start difference. First operand 509 states and 747 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:13,709 INFO L93 Difference]: Finished difference Result 879 states and 1286 transitions. [2025-02-07 22:06:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:13,711 INFO L225 Difference]: With dead ends: 879 [2025-02-07 22:06:13,711 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:13,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:13,712 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 741 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:13,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.468503937007874) internal successors, (746), 508 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-07 22:06:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 746 transitions. [2025-02-07 22:06:13,719 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 746 transitions. Word has length 75 [2025-02-07 22:06:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:13,719 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 746 transitions. [2025-02-07 22:06:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 746 transitions. [2025-02-07 22:06:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:13,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:13,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:06:13,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:13,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1233412534, now seen corresponding path program 1 times [2025-02-07 22:06:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88003754] [2025-02-07 22:06:13,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:13,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:13,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:13,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:13,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:14,038 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-07 22:06:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88003754] [2025-02-07 22:06:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88003754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533263998] [2025-02-07 22:06:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:14,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:14,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:14,040 INFO L87 Difference]: Start difference. First operand 509 states and 746 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:14,585 INFO L93 Difference]: Finished difference Result 887 states and 1295 transitions. [2025-02-07 22:06:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:14,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:14,587 INFO L225 Difference]: With dead ends: 887 [2025-02-07 22:06:14,587 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:14,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:14,588 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 743 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:14,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4665354330708662) internal successors, (745), 508 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-07 22:06:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 745 transitions. [2025-02-07 22:06:14,595 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 745 transitions. Word has length 75 [2025-02-07 22:06:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 745 transitions. [2025-02-07 22:06:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 745 transitions. [2025-02-07 22:06:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:14,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:14,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:06:14,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1059025344, now seen corresponding path program 1 times [2025-02-07 22:06:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283995344] [2025-02-07 22:06:14,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:14,918 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-07 22:06:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283995344] [2025-02-07 22:06:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283995344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747246339] [2025-02-07 22:06:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:14,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:14,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:14,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:14,919 INFO L87 Difference]: Start difference. First operand 509 states and 745 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:15,437 INFO L93 Difference]: Finished difference Result 895 states and 1304 transitions. [2025-02-07 22:06:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:15,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:15,439 INFO L225 Difference]: With dead ends: 895 [2025-02-07 22:06:15,439 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:15,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:15,440 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 745 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:15,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4645669291338583) internal successors, (744), 508 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-07 22:06:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 744 transitions. [2025-02-07 22:06:15,450 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 744 transitions. Word has length 75 [2025-02-07 22:06:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 744 transitions. [2025-02-07 22:06:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 744 transitions. [2025-02-07 22:06:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:15,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:15,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:15,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:06:15,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -376034843, now seen corresponding path program 1 times [2025-02-07 22:06:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:15,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576352086] [2025-02-07 22:06:15,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:15,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:15,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:15,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:15,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:15,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:15,827 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-07 22:06:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576352086] [2025-02-07 22:06:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576352086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163448485] [2025-02-07 22:06:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:15,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:15,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:15,828 INFO L87 Difference]: Start difference. First operand 509 states and 744 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:16,304 INFO L93 Difference]: Finished difference Result 899 states and 1308 transitions. [2025-02-07 22:06:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:16,306 INFO L225 Difference]: With dead ends: 899 [2025-02-07 22:06:16,306 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:16,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:16,306 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 745 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4625984251968505) internal successors, (743), 508 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-07 22:06:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 743 transitions. [2025-02-07 22:06:16,322 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 743 transitions. Word has length 75 [2025-02-07 22:06:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:16,322 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 743 transitions. [2025-02-07 22:06:16,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 743 transitions. [2025-02-07 22:06:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:16,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:16,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:16,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:06:16,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:16,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -784372534, now seen corresponding path program 1 times [2025-02-07 22:06:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376652496] [2025-02-07 22:06:16,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:16,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:16,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:16,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:16,568 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-07 22:06:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376652496] [2025-02-07 22:06:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376652496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649559720] [2025-02-07 22:06:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:16,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:16,570 INFO L87 Difference]: Start difference. First operand 509 states and 743 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:17,049 INFO L93 Difference]: Finished difference Result 903 states and 1312 transitions. [2025-02-07 22:06:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:17,051 INFO L225 Difference]: With dead ends: 903 [2025-02-07 22:06:17,052 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:17,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:17,053 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 745 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:17,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4606299212598426) internal successors, (742), 508 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-07 22:06:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 742 transitions. [2025-02-07 22:06:17,065 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 742 transitions. Word has length 75 [2025-02-07 22:06:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 742 transitions. [2025-02-07 22:06:17,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 742 transitions. [2025-02-07 22:06:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:17,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:17,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:06:17,067 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:17,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1940097647, now seen corresponding path program 1 times [2025-02-07 22:06:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329036921] [2025-02-07 22:06:17,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:17,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:17,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:17,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:17,369 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-07 22:06:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329036921] [2025-02-07 22:06:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329036921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585213635] [2025-02-07 22:06:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:17,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:17,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:17,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:17,372 INFO L87 Difference]: Start difference. First operand 509 states and 742 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:17,860 INFO L93 Difference]: Finished difference Result 907 states and 1316 transitions. [2025-02-07 22:06:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:17,863 INFO L225 Difference]: With dead ends: 907 [2025-02-07 22:06:17,863 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:17,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:17,864 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 745 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:17,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4586614173228347) internal successors, (741), 508 states have internal predecessors, (741), 0 states have call successors, (0), 0 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-07 22:06:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 741 transitions. [2025-02-07 22:06:17,874 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 741 transitions. Word has length 75 [2025-02-07 22:06:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 741 transitions. [2025-02-07 22:06:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 741 transitions. [2025-02-07 22:06:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:17,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:17,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:17,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:06:17,876 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2140771833, now seen corresponding path program 1 times [2025-02-07 22:06:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759440810] [2025-02-07 22:06:17,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:17,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:18,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:18,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:18,211 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-07 22:06:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759440810] [2025-02-07 22:06:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759440810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:18,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:18,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967508685] [2025-02-07 22:06:18,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:18,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:18,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:18,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:18,213 INFO L87 Difference]: Start difference. First operand 509 states and 741 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:18,737 INFO L93 Difference]: Finished difference Result 915 states and 1325 transitions. [2025-02-07 22:06:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:18,742 INFO L225 Difference]: With dead ends: 915 [2025-02-07 22:06:18,742 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:18,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:18,744 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 747 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:18,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4566929133858268) internal successors, (740), 508 states have internal predecessors, (740), 0 states have call successors, (0), 0 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-07 22:06:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2025-02-07 22:06:18,751 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 75 [2025-02-07 22:06:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2025-02-07 22:06:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2025-02-07 22:06:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:18,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:18,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:06:18,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1126878339, now seen corresponding path program 1 times [2025-02-07 22:06:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427079952] [2025-02-07 22:06:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:18,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:18,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:18,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:18,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:19,019 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-07 22:06:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427079952] [2025-02-07 22:06:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427079952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666363736] [2025-02-07 22:06:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:19,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:19,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:19,021 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:19,545 INFO L93 Difference]: Finished difference Result 923 states and 1334 transitions. [2025-02-07 22:06:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:19,547 INFO L225 Difference]: With dead ends: 923 [2025-02-07 22:06:19,547 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:19,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:19,548 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 749 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:19,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.454724409448819) internal successors, (739), 508 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-07 22:06:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 739 transitions. [2025-02-07 22:06:19,558 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 739 transitions. Word has length 75 [2025-02-07 22:06:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 739 transitions. [2025-02-07 22:06:19,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 739 transitions. [2025-02-07 22:06:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:19,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:19,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:06:19,560 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:19,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 406183912, now seen corresponding path program 1 times [2025-02-07 22:06:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369226796] [2025-02-07 22:06:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:19,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:19,848 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-07 22:06:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369226796] [2025-02-07 22:06:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369226796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803570472] [2025-02-07 22:06:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:19,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:19,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:19,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:19,849 INFO L87 Difference]: Start difference. First operand 509 states and 739 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:20,295 INFO L93 Difference]: Finished difference Result 927 states and 1338 transitions. [2025-02-07 22:06:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:20,296 INFO L225 Difference]: With dead ends: 927 [2025-02-07 22:06:20,297 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:20,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:20,298 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 749 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:20,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.452755905511811) internal successors, (738), 508 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-07 22:06:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 738 transitions. [2025-02-07 22:06:20,312 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 738 transitions. Word has length 75 [2025-02-07 22:06:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:20,312 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 738 transitions. [2025-02-07 22:06:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 738 transitions. [2025-02-07 22:06:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:20,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:20,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:20,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:06:20,317 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash -691425779, now seen corresponding path program 1 times [2025-02-07 22:06:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107894691] [2025-02-07 22:06:20,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:20,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:20,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:20,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:20,700 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-07 22:06:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107894691] [2025-02-07 22:06:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107894691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335394289] [2025-02-07 22:06:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:20,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:20,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:20,701 INFO L87 Difference]: Start difference. First operand 509 states and 738 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:21,131 INFO L93 Difference]: Finished difference Result 931 states and 1342 transitions. [2025-02-07 22:06:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:21,136 INFO L225 Difference]: With dead ends: 931 [2025-02-07 22:06:21,136 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:21,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:21,137 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 749 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4507874015748032) internal successors, (737), 508 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-07 22:06:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 737 transitions. [2025-02-07 22:06:21,151 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 737 transitions. Word has length 75 [2025-02-07 22:06:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:21,151 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 737 transitions. [2025-02-07 22:06:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 737 transitions. [2025-02-07 22:06:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:21,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:21,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:06:21,152 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1067615986, now seen corresponding path program 1 times [2025-02-07 22:06:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196853339] [2025-02-07 22:06:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:21,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:21,434 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-07 22:06:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196853339] [2025-02-07 22:06:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196853339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311497068] [2025-02-07 22:06:21,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:21,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:21,436 INFO L87 Difference]: Start difference. First operand 509 states and 737 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:21,921 INFO L93 Difference]: Finished difference Result 935 states and 1346 transitions. [2025-02-07 22:06:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:21,923 INFO L225 Difference]: With dead ends: 935 [2025-02-07 22:06:21,923 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:21,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:21,924 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 749 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:21,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4488188976377954) internal successors, (736), 508 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-07 22:06:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 736 transitions. [2025-02-07 22:06:21,934 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 736 transitions. Word has length 75 [2025-02-07 22:06:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:21,934 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 736 transitions. [2025-02-07 22:06:21,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 736 transitions. [2025-02-07 22:06:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:21,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:21,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:06:21,936 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 49322236, now seen corresponding path program 1 times [2025-02-07 22:06:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375699602] [2025-02-07 22:06:21,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:21,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:22,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:22,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:22,148 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-07 22:06:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375699602] [2025-02-07 22:06:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375699602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488607914] [2025-02-07 22:06:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:22,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:22,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:22,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:22,150 INFO L87 Difference]: Start difference. First operand 509 states and 736 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:22,633 INFO L93 Difference]: Finished difference Result 943 states and 1355 transitions. [2025-02-07 22:06:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:22,634 INFO L225 Difference]: With dead ends: 943 [2025-02-07 22:06:22,634 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:22,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:22,635 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 751 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:22,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4468503937007875) internal successors, (735), 508 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-07 22:06:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 735 transitions. [2025-02-07 22:06:22,641 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 735 transitions. Word has length 75 [2025-02-07 22:06:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:22,641 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 735 transitions. [2025-02-07 22:06:22,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 735 transitions. [2025-02-07 22:06:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:22,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:22,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:22,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:06:22,642 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1836226054, now seen corresponding path program 1 times [2025-02-07 22:06:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408941761] [2025-02-07 22:06:22,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:22,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:22,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:22,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:22,865 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-07 22:06:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408941761] [2025-02-07 22:06:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408941761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581250566] [2025-02-07 22:06:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:22,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:22,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:22,867 INFO L87 Difference]: Start difference. First operand 509 states and 735 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:23,332 INFO L93 Difference]: Finished difference Result 951 states and 1364 transitions. [2025-02-07 22:06:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:23,334 INFO L225 Difference]: With dead ends: 951 [2025-02-07 22:06:23,334 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:23,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:23,335 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 753 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:23,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4448818897637796) internal successors, (734), 508 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-07 22:06:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 734 transitions. [2025-02-07 22:06:23,344 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 734 transitions. Word has length 75 [2025-02-07 22:06:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 734 transitions. [2025-02-07 22:06:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 734 transitions. [2025-02-07 22:06:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:23,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:23,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:23,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:06:23,345 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1657078256, now seen corresponding path program 1 times [2025-02-07 22:06:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328888421] [2025-02-07 22:06:23,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:23,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:23,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:23,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:23,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:23,631 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-07 22:06:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328888421] [2025-02-07 22:06:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328888421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:23,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:23,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491574505] [2025-02-07 22:06:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:23,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:23,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:23,636 INFO L87 Difference]: Start difference. First operand 509 states and 734 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:24,099 INFO L93 Difference]: Finished difference Result 959 states and 1373 transitions. [2025-02-07 22:06:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:24,101 INFO L225 Difference]: With dead ends: 959 [2025-02-07 22:06:24,101 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:24,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:24,102 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 755 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:24,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4429133858267718) internal successors, (733), 508 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-07 22:06:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 733 transitions. [2025-02-07 22:06:24,108 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 733 transitions. Word has length 75 [2025-02-07 22:06:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:24,108 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 733 transitions. [2025-02-07 22:06:24,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 733 transitions. [2025-02-07 22:06:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:24,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:24,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:24,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:06:24,109 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 788521525, now seen corresponding path program 1 times [2025-02-07 22:06:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:24,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87500554] [2025-02-07 22:06:24,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:24,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:24,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:24,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:24,358 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-07 22:06:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87500554] [2025-02-07 22:06:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87500554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51456527] [2025-02-07 22:06:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:24,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:24,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:24,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:24,360 INFO L87 Difference]: Start difference. First operand 509 states and 733 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:24,845 INFO L93 Difference]: Finished difference Result 963 states and 1377 transitions. [2025-02-07 22:06:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:24,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:24,847 INFO L225 Difference]: With dead ends: 963 [2025-02-07 22:06:24,847 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:24,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:24,848 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 755 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:24,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.4409448818897639) internal successors, (732), 508 states have internal predecessors, (732), 0 states have call successors, (0), 0 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-07 22:06:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 732 transitions. [2025-02-07 22:06:24,861 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 732 transitions. Word has length 75 [2025-02-07 22:06:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 732 transitions. [2025-02-07 22:06:24,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 732 transitions. [2025-02-07 22:06:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:24,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:24,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:06:24,862 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:24,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1662800154, now seen corresponding path program 1 times [2025-02-07 22:06:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631825332] [2025-02-07 22:06:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:24,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:24,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:24,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:25,088 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-07 22:06:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631825332] [2025-02-07 22:06:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631825332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135554431] [2025-02-07 22:06:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:25,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:25,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:25,093 INFO L87 Difference]: Start difference. First operand 509 states and 732 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:25,556 INFO L93 Difference]: Finished difference Result 967 states and 1381 transitions. [2025-02-07 22:06:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:25,558 INFO L225 Difference]: With dead ends: 967 [2025-02-07 22:06:25,558 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:25,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:25,559 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 755 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:25,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.438976377952756) internal successors, (731), 508 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-07 22:06:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 731 transitions. [2025-02-07 22:06:25,565 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 731 transitions. Word has length 75 [2025-02-07 22:06:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:25,565 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 731 transitions. [2025-02-07 22:06:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 731 transitions. [2025-02-07 22:06:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:25,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:25,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:25,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:06:25,566 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:25,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash 30972607, now seen corresponding path program 1 times [2025-02-07 22:06:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:25,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259087189] [2025-02-07 22:06:25,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:25,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:25,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:25,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:25,769 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-07 22:06:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259087189] [2025-02-07 22:06:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259087189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:25,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10459666] [2025-02-07 22:06:25,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:25,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:25,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:25,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:25,770 INFO L87 Difference]: Start difference. First operand 509 states and 731 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:26,232 INFO L93 Difference]: Finished difference Result 971 states and 1385 transitions. [2025-02-07 22:06:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:26,233 INFO L225 Difference]: With dead ends: 971 [2025-02-07 22:06:26,233 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:26,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:26,234 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 755 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:26,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.437007874015748) internal successors, (730), 508 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-07 22:06:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 730 transitions. [2025-02-07 22:06:26,241 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 730 transitions. Word has length 75 [2025-02-07 22:06:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 730 transitions. [2025-02-07 22:06:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 730 transitions. [2025-02-07 22:06:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 22:06:26,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:26,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:26,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:06:26,243 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -785514935, now seen corresponding path program 1 times [2025-02-07 22:06:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734025859] [2025-02-07 22:06:26,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:26,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 22:06:26,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 22:06:26,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:26,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:26,407 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-07 22:06:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734025859] [2025-02-07 22:06:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734025859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:26,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:26,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243158247] [2025-02-07 22:06:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:26,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:26,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:26,408 INFO L87 Difference]: Start difference. First operand 509 states and 730 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:26,867 INFO L93 Difference]: Finished difference Result 979 states and 1394 transitions. [2025-02-07 22:06:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 22:06:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:26,868 INFO L225 Difference]: With dead ends: 979 [2025-02-07 22:06:26,868 INFO L226 Difference]: Without dead ends: 539 [2025-02-07 22:06:26,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:26,869 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 757 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:26,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 611 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-07 22:06:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 509. [2025-02-07 22:06:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.43503937007874) internal successors, (729), 508 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-07 22:06:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 729 transitions. [2025-02-07 22:06:26,876 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 729 transitions. Word has length 75 [2025-02-07 22:06:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 729 transitions. [2025-02-07 22:06:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 22:06:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 729 transitions. [2025-02-07 22:06:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:26,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:26,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:06:26,877 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2145041790, now seen corresponding path program 1 times [2025-02-07 22:06:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939298811] [2025-02-07 22:06:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:26,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:27,067 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-07 22:06:27,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939298811] [2025-02-07 22:06:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939298811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:27,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601138097] [2025-02-07 22:06:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:27,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:27,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:27,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:27,068 INFO L87 Difference]: Start difference. First operand 509 states and 729 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:27,279 INFO L93 Difference]: Finished difference Result 975 states and 1388 transitions. [2025-02-07 22:06:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:27,281 INFO L225 Difference]: With dead ends: 975 [2025-02-07 22:06:27,281 INFO L226 Difference]: Without dead ends: 537 [2025-02-07 22:06:27,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:27,282 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 748 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:27,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-07 22:06:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 507. [2025-02-07 22:06:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4328063241106719) internal successors, (725), 506 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-07 22:06:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 725 transitions. [2025-02-07 22:06:27,287 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 725 transitions. Word has length 76 [2025-02-07 22:06:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 725 transitions. [2025-02-07 22:06:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 725 transitions. [2025-02-07 22:06:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:27,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:27,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:06:27,288 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 316100775, now seen corresponding path program 1 times [2025-02-07 22:06:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075129934] [2025-02-07 22:06:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:27,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:27,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:27,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:27,458 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-07 22:06:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075129934] [2025-02-07 22:06:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075129934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520931434] [2025-02-07 22:06:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:27,460 INFO L87 Difference]: Start difference. First operand 507 states and 725 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:27,669 INFO L93 Difference]: Finished difference Result 953 states and 1359 transitions. [2025-02-07 22:06:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:27,671 INFO L225 Difference]: With dead ends: 953 [2025-02-07 22:06:27,671 INFO L226 Difference]: Without dead ends: 535 [2025-02-07 22:06:27,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:27,671 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 732 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:27,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-07 22:06:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 505. [2025-02-07 22:06:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4305555555555556) internal successors, (721), 504 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-07 22:06:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 721 transitions. [2025-02-07 22:06:27,678 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 721 transitions. Word has length 76 [2025-02-07 22:06:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 721 transitions. [2025-02-07 22:06:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 721 transitions. [2025-02-07 22:06:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:27,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:27,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:06:27,680 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -641265937, now seen corresponding path program 1 times [2025-02-07 22:06:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570038060] [2025-02-07 22:06:27,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:27,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:27,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:27,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:27,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:27,890 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-07 22:06:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570038060] [2025-02-07 22:06:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570038060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046799382] [2025-02-07 22:06:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:27,892 INFO L87 Difference]: Start difference. First operand 505 states and 721 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:28,102 INFO L93 Difference]: Finished difference Result 943 states and 1345 transitions. [2025-02-07 22:06:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:28,104 INFO L225 Difference]: With dead ends: 943 [2025-02-07 22:06:28,104 INFO L226 Difference]: Without dead ends: 533 [2025-02-07 22:06:28,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:28,104 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 722 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:28,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-07 22:06:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 503. [2025-02-07 22:06:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.4282868525896415) internal successors, (717), 502 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-07 22:06:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2025-02-07 22:06:28,110 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 76 [2025-02-07 22:06:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2025-02-07 22:06:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2025-02-07 22:06:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:28,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:28,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:06:28,111 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1904814960, now seen corresponding path program 1 times [2025-02-07 22:06:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836592711] [2025-02-07 22:06:28,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:28,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:28,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:28,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:28,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:28,272 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-07 22:06:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836592711] [2025-02-07 22:06:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836592711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549746357] [2025-02-07 22:06:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:28,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:28,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:28,274 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:28,477 INFO L93 Difference]: Finished difference Result 933 states and 1331 transitions. [2025-02-07 22:06:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:28,478 INFO L225 Difference]: With dead ends: 933 [2025-02-07 22:06:28,478 INFO L226 Difference]: Without dead ends: 531 [2025-02-07 22:06:28,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:28,479 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 712 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:28,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-07 22:06:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 501. [2025-02-07 22:06:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.426) internal successors, (713), 500 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-07 22:06:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 713 transitions. [2025-02-07 22:06:28,485 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 713 transitions. Word has length 76 [2025-02-07 22:06:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 713 transitions. [2025-02-07 22:06:28,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 713 transitions. [2025-02-07 22:06:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:28,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:28,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:28,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 22:06:28,486 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash -197056682, now seen corresponding path program 1 times [2025-02-07 22:06:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113227600] [2025-02-07 22:06:28,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:28,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:28,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:28,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:28,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:28,689 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-07 22:06:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113227600] [2025-02-07 22:06:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113227600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105059823] [2025-02-07 22:06:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:28,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:28,691 INFO L87 Difference]: Start difference. First operand 501 states and 713 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:28,896 INFO L93 Difference]: Finished difference Result 911 states and 1302 transitions. [2025-02-07 22:06:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:28,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:28,897 INFO L225 Difference]: With dead ends: 911 [2025-02-07 22:06:28,898 INFO L226 Difference]: Without dead ends: 529 [2025-02-07 22:06:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:28,898 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 696 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:28,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-07 22:06:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 499. [2025-02-07 22:06:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.4236947791164658) internal successors, (709), 498 states have internal predecessors, (709), 0 states have call successors, (0), 0 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-07 22:06:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 709 transitions. [2025-02-07 22:06:28,904 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 709 transitions. Word has length 76 [2025-02-07 22:06:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 709 transitions. [2025-02-07 22:06:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 709 transitions. [2025-02-07 22:06:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:28,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:28,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 22:06:28,905 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1873381051, now seen corresponding path program 1 times [2025-02-07 22:06:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006468903] [2025-02-07 22:06:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:28,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:28,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:29,076 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-07 22:06:29,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006468903] [2025-02-07 22:06:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006468903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:29,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332363214] [2025-02-07 22:06:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:29,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:29,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:29,078 INFO L87 Difference]: Start difference. First operand 499 states and 709 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:29,277 INFO L93 Difference]: Finished difference Result 901 states and 1288 transitions. [2025-02-07 22:06:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:29,278 INFO L225 Difference]: With dead ends: 901 [2025-02-07 22:06:29,278 INFO L226 Difference]: Without dead ends: 527 [2025-02-07 22:06:29,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:29,279 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 686 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-07 22:06:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 497. [2025-02-07 22:06:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4213709677419355) internal successors, (705), 496 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-07 22:06:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 705 transitions. [2025-02-07 22:06:29,284 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 705 transitions. Word has length 76 [2025-02-07 22:06:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:29,284 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 705 transitions. [2025-02-07 22:06:29,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 705 transitions. [2025-02-07 22:06:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:29,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:29,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:29,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 22:06:29,285 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 958845193, now seen corresponding path program 1 times [2025-02-07 22:06:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375473168] [2025-02-07 22:06:29,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:29,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:29,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:29,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:29,446 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-07 22:06:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375473168] [2025-02-07 22:06:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375473168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401522934] [2025-02-07 22:06:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:29,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:29,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:29,447 INFO L87 Difference]: Start difference. First operand 497 states and 705 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:29,662 INFO L93 Difference]: Finished difference Result 879 states and 1259 transitions. [2025-02-07 22:06:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:29,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:29,663 INFO L225 Difference]: With dead ends: 879 [2025-02-07 22:06:29,663 INFO L226 Difference]: Without dead ends: 525 [2025-02-07 22:06:29,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:29,664 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 670 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:29,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-07 22:06:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 495. [2025-02-07 22:06:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.4190283400809716) internal successors, (701), 494 states have internal predecessors, (701), 0 states have call successors, (0), 0 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-07 22:06:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 701 transitions. [2025-02-07 22:06:29,670 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 701 transitions. Word has length 76 [2025-02-07 22:06:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:29,670 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 701 transitions. [2025-02-07 22:06:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 701 transitions. [2025-02-07 22:06:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:29,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:29,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:29,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 22:06:29,671 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:29,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 383082282, now seen corresponding path program 1 times [2025-02-07 22:06:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328172129] [2025-02-07 22:06:29,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:29,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:29,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:29,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:29,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:29,841 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-07 22:06:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328172129] [2025-02-07 22:06:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328172129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:29,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504768808] [2025-02-07 22:06:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:29,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:29,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:29,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:29,842 INFO L87 Difference]: Start difference. First operand 495 states and 701 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:30,049 INFO L93 Difference]: Finished difference Result 869 states and 1245 transitions. [2025-02-07 22:06:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:30,051 INFO L225 Difference]: With dead ends: 869 [2025-02-07 22:06:30,051 INFO L226 Difference]: Without dead ends: 523 [2025-02-07 22:06:30,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:30,053 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 660 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:30,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-07 22:06:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 493. [2025-02-07 22:06:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4166666666666667) internal successors, (697), 492 states have internal predecessors, (697), 0 states have call successors, (0), 0 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-07 22:06:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 697 transitions. [2025-02-07 22:06:30,061 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 697 transitions. Word has length 76 [2025-02-07 22:06:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:30,061 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 697 transitions. [2025-02-07 22:06:30,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 697 transitions. [2025-02-07 22:06:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:30,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:30,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:30,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 22:06:30,062 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 863924138, now seen corresponding path program 1 times [2025-02-07 22:06:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956040828] [2025-02-07 22:06:30,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:30,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:30,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:30,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:30,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:30,239 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-07 22:06:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956040828] [2025-02-07 22:06:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956040828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898985895] [2025-02-07 22:06:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:30,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:30,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:30,243 INFO L87 Difference]: Start difference. First operand 493 states and 697 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:30,450 INFO L93 Difference]: Finished difference Result 859 states and 1231 transitions. [2025-02-07 22:06:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:30,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:30,452 INFO L225 Difference]: With dead ends: 859 [2025-02-07 22:06:30,452 INFO L226 Difference]: Without dead ends: 521 [2025-02-07 22:06:30,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:30,454 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 650 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:30,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-07 22:06:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 492. [2025-02-07 22:06:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4134419551934827) internal successors, (694), 491 states have internal predecessors, (694), 0 states have call successors, (0), 0 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-07 22:06:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 694 transitions. [2025-02-07 22:06:30,460 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 694 transitions. Word has length 76 [2025-02-07 22:06:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:30,460 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 694 transitions. [2025-02-07 22:06:30,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 694 transitions. [2025-02-07 22:06:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:30,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:30,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:30,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 22:06:30,461 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:30,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash -295466547, now seen corresponding path program 1 times [2025-02-07 22:06:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411028435] [2025-02-07 22:06:30,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:30,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:30,653 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-07 22:06:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411028435] [2025-02-07 22:06:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411028435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717029550] [2025-02-07 22:06:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:30,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:30,655 INFO L87 Difference]: Start difference. First operand 492 states and 694 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:30,855 INFO L93 Difference]: Finished difference Result 860 states and 1230 transitions. [2025-02-07 22:06:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:30,856 INFO L225 Difference]: With dead ends: 860 [2025-02-07 22:06:30,856 INFO L226 Difference]: Without dead ends: 519 [2025-02-07 22:06:30,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:30,857 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 646 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:30,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-07 22:06:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 490. [2025-02-07 22:06:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 489 states have internal predecessors, (690), 0 states have call successors, (0), 0 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-07 22:06:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 690 transitions. [2025-02-07 22:06:30,872 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 690 transitions. Word has length 76 [2025-02-07 22:06:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:30,873 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 690 transitions. [2025-02-07 22:06:30,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 690 transitions. [2025-02-07 22:06:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:30,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:30,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:06:30,873 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1049619418, now seen corresponding path program 1 times [2025-02-07 22:06:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860643756] [2025-02-07 22:06:30,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:30,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:31,055 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-07 22:06:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860643756] [2025-02-07 22:06:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860643756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345153022] [2025-02-07 22:06:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:31,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:31,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:31,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:31,056 INFO L87 Difference]: Start difference. First operand 490 states and 690 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:31,259 INFO L93 Difference]: Finished difference Result 862 states and 1230 transitions. [2025-02-07 22:06:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:31,261 INFO L225 Difference]: With dead ends: 862 [2025-02-07 22:06:31,261 INFO L226 Difference]: Without dead ends: 517 [2025-02-07 22:06:31,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:31,265 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 644 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:31,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-07 22:06:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 488. [2025-02-07 22:06:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.408624229979466) internal successors, (686), 487 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-07 22:06:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 686 transitions. [2025-02-07 22:06:31,271 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 686 transitions. Word has length 76 [2025-02-07 22:06:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 686 transitions. [2025-02-07 22:06:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 686 transitions. [2025-02-07 22:06:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:31,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:31,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 22:06:31,272 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1849709412, now seen corresponding path program 1 times [2025-02-07 22:06:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993462420] [2025-02-07 22:06:31,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:31,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:31,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:31,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:31,515 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-07 22:06:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993462420] [2025-02-07 22:06:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993462420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:31,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597136833] [2025-02-07 22:06:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:31,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:31,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:31,517 INFO L87 Difference]: Start difference. First operand 488 states and 686 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:31,740 INFO L93 Difference]: Finished difference Result 864 states and 1230 transitions. [2025-02-07 22:06:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:31,742 INFO L225 Difference]: With dead ends: 864 [2025-02-07 22:06:31,742 INFO L226 Difference]: Without dead ends: 515 [2025-02-07 22:06:31,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:31,743 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 642 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:31,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-07 22:06:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 486. [2025-02-07 22:06:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.4061855670103092) internal successors, (682), 485 states have internal predecessors, (682), 0 states have call successors, (0), 0 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-07 22:06:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 682 transitions. [2025-02-07 22:06:31,753 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 682 transitions. Word has length 76 [2025-02-07 22:06:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 682 transitions. [2025-02-07 22:06:31,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 682 transitions. [2025-02-07 22:06:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:31,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:31,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 22:06:31,754 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1746724415, now seen corresponding path program 1 times [2025-02-07 22:06:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495486653] [2025-02-07 22:06:31,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:31,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:31,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:31,986 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-07 22:06:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495486653] [2025-02-07 22:06:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495486653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:31,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:31,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608271707] [2025-02-07 22:06:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:31,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:31,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:31,987 INFO L87 Difference]: Start difference. First operand 486 states and 682 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:32,189 INFO L93 Difference]: Finished difference Result 864 states and 1228 transitions. [2025-02-07 22:06:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:32,191 INFO L225 Difference]: With dead ends: 864 [2025-02-07 22:06:32,191 INFO L226 Difference]: Without dead ends: 513 [2025-02-07 22:06:32,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:32,195 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 638 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:32,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-02-07 22:06:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 484. [2025-02-07 22:06:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4037267080745341) internal successors, (678), 483 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-07 22:06:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 678 transitions. [2025-02-07 22:06:32,205 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 678 transitions. Word has length 76 [2025-02-07 22:06:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:32,205 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 678 transitions. [2025-02-07 22:06:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 678 transitions. [2025-02-07 22:06:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:32,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:32,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 22:06:32,206 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544189, now seen corresponding path program 1 times [2025-02-07 22:06:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411200491] [2025-02-07 22:06:32,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:32,407 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-07 22:06:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:32,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411200491] [2025-02-07 22:06:32,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411200491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803163794] [2025-02-07 22:06:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:32,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:32,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:32,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:32,409 INFO L87 Difference]: Start difference. First operand 484 states and 678 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:32,632 INFO L93 Difference]: Finished difference Result 864 states and 1226 transitions. [2025-02-07 22:06:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:32,634 INFO L225 Difference]: With dead ends: 864 [2025-02-07 22:06:32,634 INFO L226 Difference]: Without dead ends: 511 [2025-02-07 22:06:32,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:32,635 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 634 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:32,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-07 22:06:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 482. [2025-02-07 22:06:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.4012474012474012) internal successors, (674), 481 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:06:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 674 transitions. [2025-02-07 22:06:32,640 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 674 transitions. Word has length 76 [2025-02-07 22:06:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:32,640 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 674 transitions. [2025-02-07 22:06:32,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 674 transitions. [2025-02-07 22:06:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:32,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:32,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:32,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 22:06:32,644 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:32,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 793403098, now seen corresponding path program 1 times [2025-02-07 22:06:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112215047] [2025-02-07 22:06:32,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:32,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:32,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:32,856 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-07 22:06:32,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112215047] [2025-02-07 22:06:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112215047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:32,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544339738] [2025-02-07 22:06:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:32,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:32,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:32,857 INFO L87 Difference]: Start difference. First operand 482 states and 674 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:33,053 INFO L93 Difference]: Finished difference Result 864 states and 1224 transitions. [2025-02-07 22:06:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:33,055 INFO L225 Difference]: With dead ends: 864 [2025-02-07 22:06:33,055 INFO L226 Difference]: Without dead ends: 509 [2025-02-07 22:06:33,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:33,056 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 630 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:33,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-07 22:06:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 480. [2025-02-07 22:06:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.3987473903966596) internal successors, (670), 479 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-07 22:06:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 670 transitions. [2025-02-07 22:06:33,062 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 670 transitions. Word has length 76 [2025-02-07 22:06:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:33,062 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 670 transitions. [2025-02-07 22:06:33,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 670 transitions. [2025-02-07 22:06:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:33,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:33,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 22:06:33,065 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1040306660, now seen corresponding path program 1 times [2025-02-07 22:06:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139230642] [2025-02-07 22:06:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:33,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:33,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:33,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:33,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:33,269 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-07 22:06:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139230642] [2025-02-07 22:06:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139230642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961295300] [2025-02-07 22:06:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:33,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:33,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:33,270 INFO L87 Difference]: Start difference. First operand 480 states and 670 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:33,444 INFO L93 Difference]: Finished difference Result 866 states and 1224 transitions. [2025-02-07 22:06:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:33,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:33,445 INFO L225 Difference]: With dead ends: 866 [2025-02-07 22:06:33,445 INFO L226 Difference]: Without dead ends: 507 [2025-02-07 22:06:33,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:33,446 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 628 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:33,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-07 22:06:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 478. [2025-02-07 22:06:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.3962264150943395) internal successors, (666), 477 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-07 22:06:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-02-07 22:06:33,451 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 76 [2025-02-07 22:06:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:33,451 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-02-07 22:06:33,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-02-07 22:06:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:33,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:33,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:33,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 22:06:33,452 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash 301789753, now seen corresponding path program 1 times [2025-02-07 22:06:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017394302] [2025-02-07 22:06:33,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:33,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:33,658 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-07 22:06:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017394302] [2025-02-07 22:06:33,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017394302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:33,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:33,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:33,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979964640] [2025-02-07 22:06:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:33,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:33,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:33,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:33,659 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:33,829 INFO L93 Difference]: Finished difference Result 868 states and 1224 transitions. [2025-02-07 22:06:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:33,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:33,831 INFO L225 Difference]: With dead ends: 868 [2025-02-07 22:06:33,831 INFO L226 Difference]: Without dead ends: 505 [2025-02-07 22:06:33,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:33,831 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 626 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:33,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-07 22:06:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 476. [2025-02-07 22:06:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.3936842105263159) internal successors, (662), 475 states have internal predecessors, (662), 0 states have call successors, (0), 0 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-07 22:06:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 662 transitions. [2025-02-07 22:06:33,836 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 662 transitions. Word has length 76 [2025-02-07 22:06:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:33,836 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 662 transitions. [2025-02-07 22:06:33,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 662 transitions. [2025-02-07 22:06:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:33,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:33,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:33,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 22:06:33,837 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:33,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 534294742, now seen corresponding path program 1 times [2025-02-07 22:06:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964732434] [2025-02-07 22:06:33,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:33,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:33,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:33,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:33,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:34,002 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-07 22:06:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964732434] [2025-02-07 22:06:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964732434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849258760] [2025-02-07 22:06:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:34,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:34,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:34,003 INFO L87 Difference]: Start difference. First operand 476 states and 662 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:34,169 INFO L93 Difference]: Finished difference Result 868 states and 1222 transitions. [2025-02-07 22:06:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:34,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:34,170 INFO L225 Difference]: With dead ends: 868 [2025-02-07 22:06:34,170 INFO L226 Difference]: Without dead ends: 503 [2025-02-07 22:06:34,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:34,171 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 622 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:34,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-07 22:06:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 474. [2025-02-07 22:06:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.3911205073995772) internal successors, (658), 473 states have internal predecessors, (658), 0 states have call successors, (0), 0 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-07 22:06:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 658 transitions. [2025-02-07 22:06:34,176 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 658 transitions. Word has length 76 [2025-02-07 22:06:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:34,176 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 658 transitions. [2025-02-07 22:06:34,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 658 transitions. [2025-02-07 22:06:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:34,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:34,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:34,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 22:06:34,177 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 241106386, now seen corresponding path program 1 times [2025-02-07 22:06:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:34,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618132691] [2025-02-07 22:06:34,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:34,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:34,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:34,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:34,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:34,367 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-07 22:06:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618132691] [2025-02-07 22:06:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618132691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756356341] [2025-02-07 22:06:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:34,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:34,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:34,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:34,368 INFO L87 Difference]: Start difference. First operand 474 states and 658 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:34,559 INFO L93 Difference]: Finished difference Result 868 states and 1220 transitions. [2025-02-07 22:06:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:34,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:34,562 INFO L225 Difference]: With dead ends: 868 [2025-02-07 22:06:34,562 INFO L226 Difference]: Without dead ends: 501 [2025-02-07 22:06:34,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:34,563 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 618 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:34,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-07 22:06:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 472. [2025-02-07 22:06:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.3885350318471337) internal successors, (654), 471 states have internal predecessors, (654), 0 states have call successors, (0), 0 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-07 22:06:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 654 transitions. [2025-02-07 22:06:34,568 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 654 transitions. Word has length 76 [2025-02-07 22:06:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:34,568 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 654 transitions. [2025-02-07 22:06:34,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 654 transitions. [2025-02-07 22:06:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:34,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:34,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 22:06:34,568 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1007150219, now seen corresponding path program 1 times [2025-02-07 22:06:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598976951] [2025-02-07 22:06:34,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:34,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:34,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:34,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:34,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:34,744 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-07 22:06:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598976951] [2025-02-07 22:06:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598976951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507278525] [2025-02-07 22:06:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:34,745 INFO L87 Difference]: Start difference. First operand 472 states and 654 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:34,912 INFO L93 Difference]: Finished difference Result 868 states and 1218 transitions. [2025-02-07 22:06:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:34,913 INFO L225 Difference]: With dead ends: 868 [2025-02-07 22:06:34,913 INFO L226 Difference]: Without dead ends: 499 [2025-02-07 22:06:34,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:34,913 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 614 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:34,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-07 22:06:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 470. [2025-02-07 22:06:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.3859275053304905) internal successors, (650), 469 states have internal predecessors, (650), 0 states have call successors, (0), 0 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-07 22:06:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 650 transitions. [2025-02-07 22:06:34,918 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 650 transitions. Word has length 76 [2025-02-07 22:06:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 650 transitions. [2025-02-07 22:06:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 650 transitions. [2025-02-07 22:06:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:34,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:34,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:34,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 22:06:34,919 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:34,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 712754221, now seen corresponding path program 1 times [2025-02-07 22:06:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976023769] [2025-02-07 22:06:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:34,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:34,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:34,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:34,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:35,097 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-07 22:06:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976023769] [2025-02-07 22:06:35,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976023769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:35,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:35,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218545112] [2025-02-07 22:06:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:35,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:35,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:35,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:35,098 INFO L87 Difference]: Start difference. First operand 470 states and 650 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:35,265 INFO L93 Difference]: Finished difference Result 870 states and 1218 transitions. [2025-02-07 22:06:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:35,266 INFO L225 Difference]: With dead ends: 870 [2025-02-07 22:06:35,266 INFO L226 Difference]: Without dead ends: 497 [2025-02-07 22:06:35,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:35,267 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 612 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:35,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-07 22:06:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 468. [2025-02-07 22:06:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.3832976445396146) internal successors, (646), 467 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-07 22:06:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 646 transitions. [2025-02-07 22:06:35,272 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 646 transitions. Word has length 76 [2025-02-07 22:06:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:35,272 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 646 transitions. [2025-02-07 22:06:35,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 646 transitions. [2025-02-07 22:06:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:35,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:35,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 22:06:35,272 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1403222662, now seen corresponding path program 1 times [2025-02-07 22:06:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373699047] [2025-02-07 22:06:35,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:35,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:35,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:35,478 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-07 22:06:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373699047] [2025-02-07 22:06:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373699047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677787599] [2025-02-07 22:06:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:35,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:35,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:35,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:35,479 INFO L87 Difference]: Start difference. First operand 468 states and 646 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:35,660 INFO L93 Difference]: Finished difference Result 872 states and 1218 transitions. [2025-02-07 22:06:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:35,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:35,661 INFO L225 Difference]: With dead ends: 872 [2025-02-07 22:06:35,661 INFO L226 Difference]: Without dead ends: 495 [2025-02-07 22:06:35,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:35,662 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 610 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:35,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-07 22:06:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 466. [2025-02-07 22:06:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.3806451612903226) internal successors, (642), 465 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-07 22:06:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 642 transitions. [2025-02-07 22:06:35,669 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 642 transitions. Word has length 76 [2025-02-07 22:06:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:35,669 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 642 transitions. [2025-02-07 22:06:35,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 642 transitions. [2025-02-07 22:06:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:35,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:35,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:35,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 22:06:35,670 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 167298632, now seen corresponding path program 1 times [2025-02-07 22:06:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275171011] [2025-02-07 22:06:35,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:35,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:35,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:35,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:35,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:35,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:35,865 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-07 22:06:35,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:35,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275171011] [2025-02-07 22:06:35,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275171011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:35,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:35,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530068705] [2025-02-07 22:06:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:35,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:35,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:35,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:35,867 INFO L87 Difference]: Start difference. First operand 466 states and 642 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:36,074 INFO L93 Difference]: Finished difference Result 874 states and 1218 transitions. [2025-02-07 22:06:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:36,075 INFO L225 Difference]: With dead ends: 874 [2025-02-07 22:06:36,075 INFO L226 Difference]: Without dead ends: 493 [2025-02-07 22:06:36,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:36,075 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 608 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:36,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-07 22:06:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 464. [2025-02-07 22:06:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.3779697624190064) internal successors, (638), 463 states have internal predecessors, (638), 0 states have call successors, (0), 0 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-07 22:06:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 638 transitions. [2025-02-07 22:06:36,080 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 638 transitions. Word has length 76 [2025-02-07 22:06:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:36,080 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 638 transitions. [2025-02-07 22:06:36,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 638 transitions. [2025-02-07 22:06:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:36,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:36,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:36,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 22:06:36,081 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:36,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash -775588606, now seen corresponding path program 1 times [2025-02-07 22:06:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:36,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745899773] [2025-02-07 22:06:36,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:36,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:36,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:36,252 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-07 22:06:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745899773] [2025-02-07 22:06:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745899773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:36,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:36,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322634926] [2025-02-07 22:06:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:36,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:36,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:36,254 INFO L87 Difference]: Start difference. First operand 464 states and 638 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:36,446 INFO L93 Difference]: Finished difference Result 874 states and 1216 transitions. [2025-02-07 22:06:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:36,448 INFO L225 Difference]: With dead ends: 874 [2025-02-07 22:06:36,448 INFO L226 Difference]: Without dead ends: 491 [2025-02-07 22:06:36,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:36,449 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 604 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:36,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-07 22:06:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 462. [2025-02-07 22:06:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.3752711496746204) internal successors, (634), 461 states have internal predecessors, (634), 0 states have call successors, (0), 0 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-07 22:06:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 634 transitions. [2025-02-07 22:06:36,459 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 634 transitions. Word has length 76 [2025-02-07 22:06:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 634 transitions. [2025-02-07 22:06:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 634 transitions. [2025-02-07 22:06:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:36,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 22:06:36,461 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 460005541, now seen corresponding path program 1 times [2025-02-07 22:06:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829363222] [2025-02-07 22:06:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:36,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:36,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:36,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:36,664 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-07 22:06:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829363222] [2025-02-07 22:06:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829363222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524715894] [2025-02-07 22:06:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:36,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:36,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:36,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:36,665 INFO L87 Difference]: Start difference. First operand 462 states and 634 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:36,854 INFO L93 Difference]: Finished difference Result 874 states and 1214 transitions. [2025-02-07 22:06:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:36,855 INFO L225 Difference]: With dead ends: 874 [2025-02-07 22:06:36,855 INFO L226 Difference]: Without dead ends: 489 [2025-02-07 22:06:36,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:36,856 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 600 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:36,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-07 22:06:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 460. [2025-02-07 22:06:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.3725490196078431) internal successors, (630), 459 states have internal predecessors, (630), 0 states have call successors, (0), 0 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-07 22:06:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 630 transitions. [2025-02-07 22:06:36,868 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 630 transitions. Word has length 76 [2025-02-07 22:06:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:36,868 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 630 transitions. [2025-02-07 22:06:36,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 630 transitions. [2025-02-07 22:06:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:36,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:36,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:36,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 22:06:36,872 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:36,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1715038078, now seen corresponding path program 1 times [2025-02-07 22:06:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:36,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813644067] [2025-02-07 22:06:36,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:36,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:37,075 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-07 22:06:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813644067] [2025-02-07 22:06:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813644067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:37,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048786397] [2025-02-07 22:06:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:37,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:37,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:37,077 INFO L87 Difference]: Start difference. First operand 460 states and 630 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:37,269 INFO L93 Difference]: Finished difference Result 874 states and 1212 transitions. [2025-02-07 22:06:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:37,271 INFO L225 Difference]: With dead ends: 874 [2025-02-07 22:06:37,271 INFO L226 Difference]: Without dead ends: 487 [2025-02-07 22:06:37,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:37,271 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 596 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:37,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-07 22:06:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 458. [2025-02-07 22:06:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3698030634573304) internal successors, (626), 457 states have internal predecessors, (626), 0 states have call successors, (0), 0 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-07 22:06:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 626 transitions. [2025-02-07 22:06:37,277 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 626 transitions. Word has length 76 [2025-02-07 22:06:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 626 transitions. [2025-02-07 22:06:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 626 transitions. [2025-02-07 22:06:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:06:37,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:37,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:37,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 22:06:37,278 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -413832223, now seen corresponding path program 1 times [2025-02-07 22:06:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816755827] [2025-02-07 22:06:37,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:06:37,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:06:37,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:37,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:37,507 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-07 22:06:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:37,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816755827] [2025-02-07 22:06:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816755827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:37,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914195649] [2025-02-07 22:06:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:37,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:37,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:37,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:06:37,508 INFO L87 Difference]: Start difference. First operand 458 states and 626 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:37,710 INFO L93 Difference]: Finished difference Result 808 states and 1139 transitions. [2025-02-07 22:06:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:06:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 22:06:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:37,711 INFO L225 Difference]: With dead ends: 808 [2025-02-07 22:06:37,711 INFO L226 Difference]: Without dead ends: 417 [2025-02-07 22:06:37,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:37,712 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 568 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:37,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 966 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:06:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-07 22:06:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 404. [2025-02-07 22:06:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.4168734491315136) internal successors, (571), 403 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-07 22:06:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 571 transitions. [2025-02-07 22:06:37,719 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 571 transitions. Word has length 76 [2025-02-07 22:06:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:37,719 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 571 transitions. [2025-02-07 22:06:37,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 22:06:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 571 transitions. [2025-02-07 22:06:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-07 22:06:37,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:37,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:37,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 22:06:37,721 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1529679998, now seen corresponding path program 1 times [2025-02-07 22:06:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:37,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140561082] [2025-02-07 22:06:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:37,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 22:06:38,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 22:06:38,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:38,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140561082] [2025-02-07 22:06:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140561082] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:06:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482842621] [2025-02-07 22:06:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:39,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:06:39,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:06:39,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:06:39,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 22:06:40,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 22:06:40,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:40,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 22:06:40,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:06:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:41,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:06:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 22:06:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482842621] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 22:06:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:06:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 21 [2025-02-07 22:06:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032766819] [2025-02-07 22:06:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:06:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:06:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-02-07 22:06:41,626 INFO L87 Difference]: Start difference. First operand 404 states and 571 transitions. Second operand has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-07 22:06:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:42,179 INFO L93 Difference]: Finished difference Result 868 states and 1253 transitions. [2025-02-07 22:06:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:06:42,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 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 214 [2025-02-07 22:06:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:42,180 INFO L225 Difference]: With dead ends: 868 [2025-02-07 22:06:42,180 INFO L226 Difference]: Without dead ends: 531 [2025-02-07 22:06:42,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:06:42,181 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 261 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:42,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1145 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-07 22:06:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 502. [2025-02-07 22:06:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.4311377245508983) internal successors, (717), 501 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-07 22:06:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 717 transitions. [2025-02-07 22:06:42,186 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 717 transitions. Word has length 214 [2025-02-07 22:06:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:42,187 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 717 transitions. [2025-02-07 22:06:42,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-07 22:06:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 717 transitions. [2025-02-07 22:06:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-07 22:06:42,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:42,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:42,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:06:42,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:42,392 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1847905015, now seen corresponding path program 1 times [2025-02-07 22:06:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203191836] [2025-02-07 22:06:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:42,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 22:06:42,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 22:06:42,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203191836] [2025-02-07 22:06:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203191836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:06:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27521960] [2025-02-07 22:06:44,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:44,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:06:44,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:06:44,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:06:45,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 22:06:45,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 22:06:45,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:45,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:45,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 22:06:45,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:06:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 22:06:45,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:06:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27521960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:06:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-07 22:06:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494053406] [2025-02-07 22:06:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:45,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:06:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:45,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:06:45,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:06:45,720 INFO L87 Difference]: Start difference. First operand 502 states and 717 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 22:06:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:46,236 INFO L93 Difference]: Finished difference Result 1122 states and 1631 transitions. [2025-02-07 22:06:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:06:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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 214 [2025-02-07 22:06:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:46,238 INFO L225 Difference]: With dead ends: 1122 [2025-02-07 22:06:46,238 INFO L226 Difference]: Without dead ends: 687 [2025-02-07 22:06:46,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:06:46,239 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 113 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:46,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1172 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-07 22:06:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 500. [2025-02-07 22:06:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.4308617234468939) internal successors, (714), 499 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-07 22:06:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 714 transitions. [2025-02-07 22:06:46,244 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 714 transitions. Word has length 214 [2025-02-07 22:06:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:46,244 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 714 transitions. [2025-02-07 22:06:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 22:06:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 714 transitions. [2025-02-07 22:06:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-07 22:06:46,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:46,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:46,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 22:06:46,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:46,446 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:46,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1075555713, now seen corresponding path program 1 times [2025-02-07 22:06:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633388539] [2025-02-07 22:06:46,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:46,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:46,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 22:06:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 22:06:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat