./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.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.safe_intersymbol_analog_estimation_convergence.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 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:55:41,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:55:41,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:55:41,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:55:41,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:55:41,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:55:41,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:55:41,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:55:41,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:55:41,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:55:41,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:55:41,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:55:41,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:55:41,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:55:41,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:55:41,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:55:41,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:55:41,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:55:41,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:55:41,432 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 -> 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 [2025-02-07 23:55:41,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:55:41,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:55:41,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:55:41,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:55:41,649 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:55:41,650 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.safe_intersymbol_analog_estimation_convergence.c [2025-02-07 23:55:42,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81d2649f5/8918440dc49c472bbfb603bca162f6de/FLAG9a5271e25 [2025-02-07 23:55:43,164 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:55:43,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2025-02-07 23:55:43,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81d2649f5/8918440dc49c472bbfb603bca162f6de/FLAG9a5271e25 [2025-02-07 23:55:43,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81d2649f5/8918440dc49c472bbfb603bca162f6de [2025-02-07 23:55:43,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:55:43,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:55:43,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:55:43,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:55:43,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:55:43,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:43,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43, skipping insertion in model container [2025-02-07 23:55:43,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:43,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:55:43,610 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.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2025-02-07 23:55:43,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:55:43,787 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:55:43,795 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.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2025-02-07 23:55:43,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:55:43,916 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:55:43,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43 WrapperNode [2025-02-07 23:55:43,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:55:43,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:55:43,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:55:43,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:55:43,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:43,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,110 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1979 [2025-02-07 23:55:44,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:55:44,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:55:44,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:55:44,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:55:44,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,165 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 23:55:44,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:55:44,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:55:44,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:55:44,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:55:44,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (1/1) ... [2025-02-07 23:55:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:55:44,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:55:44,293 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 23:55:44,303 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 23:55:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:55:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 23:55:44,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 23:55:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:55:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:55:44,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:55:44,495 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:55:44,497 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:55:46,533 INFO L? ?]: Removed 1002 outVars from TransFormulas that were not future-live. [2025-02-07 23:55:46,534 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:55:46,606 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:55:46,606 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:55:46,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:55:46 BoogieIcfgContainer [2025-02-07 23:55:46,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:55:46,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:55:46,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:55:46,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:55:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:55:43" (1/3) ... [2025-02-07 23:55:46,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e6be8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:55:46, skipping insertion in model container [2025-02-07 23:55:46,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:55:43" (2/3) ... [2025-02-07 23:55:46,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e6be8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:55:46, skipping insertion in model container [2025-02-07 23:55:46,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:55:46" (3/3) ... [2025-02-07 23:55:46,614 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2025-02-07 23:55:46,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:55:46,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c that has 2 procedures, 670 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:55:46,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:55:46,729 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;@6f8bf4a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:55:46,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:55:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 670 states, 665 states have (on average 1.5052631578947369) internal successors, (1001), 666 states have internal predecessors, (1001), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-07 23:55:46,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:46,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:46,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1970982927, now seen corresponding path program 1 times [2025-02-07 23:55:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734560854] [2025-02-07 23:55:46,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:46,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-07 23:55:46,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-07 23:55:46,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:55:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:47,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734560854] [2025-02-07 23:55:47,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734560854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:55:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492892678] [2025-02-07 23:55:47,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:47,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:55:47,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:55:47,216 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 23:55:47,217 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 23:55:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-07 23:55:47,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-07 23:55:47,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:47,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:47,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 23:55:47,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:55:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:55:47,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:55:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492892678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:55:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 23:55:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535920214] [2025-02-07 23:55:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:47,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 23:55:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:47,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 23:55:47,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 23:55:47,676 INFO L87 Difference]: Start difference. First operand has 670 states, 665 states have (on average 1.5052631578947369) internal successors, (1001), 666 states have internal predecessors, (1001), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:47,935 INFO L93 Difference]: Finished difference Result 1305 states and 1962 transitions. [2025-02-07 23:55:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 23:55:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 224 [2025-02-07 23:55:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:47,944 INFO L225 Difference]: With dead ends: 1305 [2025-02-07 23:55:47,944 INFO L226 Difference]: Without dead ends: 668 [2025-02-07 23:55:47,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 23:55:47,949 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:47,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:55:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-07 23:55:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-02-07 23:55:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 664 states have (on average 1.4894578313253013) internal successors, (989), 664 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 993 transitions. [2025-02-07 23:55:48,003 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 993 transitions. Word has length 224 [2025-02-07 23:55:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:48,003 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 993 transitions. [2025-02-07 23:55:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 993 transitions. [2025-02-07 23:55:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-07 23:55:48,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:48,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:48,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:55:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 23:55:48,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1495217425, now seen corresponding path program 1 times [2025-02-07 23:55:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32317195] [2025-02-07 23:55:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:48,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-07 23:55:48,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-07 23:55:48,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:48,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32317195] [2025-02-07 23:55:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32317195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135374121] [2025-02-07 23:55:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:49,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:49,273 INFO L87 Difference]: Start difference. First operand 668 states and 993 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:49,799 INFO L93 Difference]: Finished difference Result 1302 states and 1936 transitions. [2025-02-07 23:55:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 224 [2025-02-07 23:55:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:49,803 INFO L225 Difference]: With dead ends: 1302 [2025-02-07 23:55:49,804 INFO L226 Difference]: Without dead ends: 667 [2025-02-07 23:55:49,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:55:49,807 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 958 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:49,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1541 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:55:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-07 23:55:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-02-07 23:55:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 663 states have (on average 1.4871794871794872) internal successors, (986), 663 states have internal predecessors, (986), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 990 transitions. [2025-02-07 23:55:49,830 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 990 transitions. Word has length 224 [2025-02-07 23:55:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 990 transitions. [2025-02-07 23:55:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 990 transitions. [2025-02-07 23:55:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-07 23:55:49,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:49,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:49,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:55:49,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:49,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1401354600, now seen corresponding path program 1 times [2025-02-07 23:55:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981661045] [2025-02-07 23:55:49,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:49,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-07 23:55:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-07 23:55:49,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981661045] [2025-02-07 23:55:50,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981661045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:50,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080127240] [2025-02-07 23:55:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:50,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:50,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:50,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:50,477 INFO L87 Difference]: Start difference. First operand 667 states and 990 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:50,758 INFO L93 Difference]: Finished difference Result 671 states and 994 transitions. [2025-02-07 23:55:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-02-07 23:55:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:50,762 INFO L225 Difference]: With dead ends: 671 [2025-02-07 23:55:50,762 INFO L226 Difference]: Without dead ends: 669 [2025-02-07 23:55:50,762 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 23:55:50,763 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 0 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:50,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2479 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:55:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-02-07 23:55:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2025-02-07 23:55:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 665 states have (on average 1.4857142857142858) internal successors, (988), 665 states have internal predecessors, (988), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 992 transitions. [2025-02-07 23:55:50,774 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 992 transitions. Word has length 225 [2025-02-07 23:55:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:50,775 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 992 transitions. [2025-02-07 23:55:50,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 992 transitions. [2025-02-07 23:55:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-07 23:55:50,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:50,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:50,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:55:50,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:50,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash 496999198, now seen corresponding path program 1 times [2025-02-07 23:55:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:50,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921592665] [2025-02-07 23:55:50,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:50,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-07 23:55:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-07 23:55:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921592665] [2025-02-07 23:55:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921592665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100892727] [2025-02-07 23:55:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:51,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:51,224 INFO L87 Difference]: Start difference. First operand 669 states and 992 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:51,604 INFO L93 Difference]: Finished difference Result 1307 states and 1938 transitions. [2025-02-07 23:55:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2025-02-07 23:55:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:51,607 INFO L225 Difference]: With dead ends: 1307 [2025-02-07 23:55:51,608 INFO L226 Difference]: Without dead ends: 671 [2025-02-07 23:55:51,609 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 23:55:51,609 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 0 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:51,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2476 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:55:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-07 23:55:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-02-07 23:55:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 667 states have (on average 1.4842578710644678) internal successors, (990), 667 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2025-02-07 23:55:51,626 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 226 [2025-02-07 23:55:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2025-02-07 23:55:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2025-02-07 23:55:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-07 23:55:51,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:51,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:51,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:55:51,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:51,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash 158615587, now seen corresponding path program 1 times [2025-02-07 23:55:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261397312] [2025-02-07 23:55:51,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:51,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-07 23:55:51,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-07 23:55:51,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:51,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261397312] [2025-02-07 23:55:52,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261397312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708114724] [2025-02-07 23:55:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:52,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:52,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:52,171 INFO L87 Difference]: Start difference. First operand 671 states and 994 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:52,518 INFO L93 Difference]: Finished difference Result 1309 states and 1939 transitions. [2025-02-07 23:55:52,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:52,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2025-02-07 23:55:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:52,521 INFO L225 Difference]: With dead ends: 1309 [2025-02-07 23:55:52,522 INFO L226 Difference]: Without dead ends: 671 [2025-02-07 23:55:52,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:55:52,523 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 948 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:52,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1635 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:55:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-07 23:55:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-02-07 23:55:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 667 states have (on average 1.4827586206896552) internal successors, (989), 667 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 993 transitions. [2025-02-07 23:55:52,539 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 993 transitions. Word has length 227 [2025-02-07 23:55:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 993 transitions. [2025-02-07 23:55:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 993 transitions. [2025-02-07 23:55:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-07 23:55:52,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:52,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:52,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:55:52,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1407046894, now seen corresponding path program 1 times [2025-02-07 23:55:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309776044] [2025-02-07 23:55:52,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:52,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-07 23:55:52,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-07 23:55:52,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:52,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309776044] [2025-02-07 23:55:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309776044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798154639] [2025-02-07 23:55:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:53,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:53,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:53,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:53,042 INFO L87 Difference]: Start difference. First operand 671 states and 993 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:53,614 INFO L93 Difference]: Finished difference Result 1309 states and 1937 transitions. [2025-02-07 23:55:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2025-02-07 23:55:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:53,617 INFO L225 Difference]: With dead ends: 1309 [2025-02-07 23:55:53,617 INFO L226 Difference]: Without dead ends: 671 [2025-02-07 23:55:53,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:55:53,618 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 946 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:53,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1635 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:55:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-07 23:55:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-02-07 23:55:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 667 states have (on average 1.4812593703148427) internal successors, (988), 667 states have internal predecessors, (988), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:55:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 992 transitions. [2025-02-07 23:55:53,632 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 992 transitions. Word has length 228 [2025-02-07 23:55:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:53,633 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 992 transitions. [2025-02-07 23:55:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 992 transitions. [2025-02-07 23:55:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-07 23:55:53,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:53,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:53,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:55:53,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:53,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1967779808, now seen corresponding path program 1 times [2025-02-07 23:55:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:53,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447403307] [2025-02-07 23:55:53,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-07 23:55:53,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-07 23:55:53,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447403307] [2025-02-07 23:55:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447403307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:55:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460204492] [2025-02-07 23:55:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:55:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:55:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:55:54,303 INFO L87 Difference]: Start difference. First operand 671 states and 992 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:54,795 INFO L93 Difference]: Finished difference Result 1827 states and 2703 transitions. [2025-02-07 23:55:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:55:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229 [2025-02-07 23:55:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:54,800 INFO L225 Difference]: With dead ends: 1827 [2025-02-07 23:55:54,801 INFO L226 Difference]: Without dead ends: 1189 [2025-02-07 23:55:54,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:55:54,802 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 739 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:54,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 3243 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:55:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-02-07 23:55:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 709. [2025-02-07 23:55:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 703 states have (on average 1.4751066856330015) internal successors, (1037), 703 states have internal predecessors, (1037), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 23:55:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1045 transitions. [2025-02-07 23:55:54,818 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1045 transitions. Word has length 229 [2025-02-07 23:55:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1045 transitions. [2025-02-07 23:55:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1045 transitions. [2025-02-07 23:55:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-07 23:55:54,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:54,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:54,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:55:54,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 914372780, now seen corresponding path program 1 times [2025-02-07 23:55:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650988538] [2025-02-07 23:55:54,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:54,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 23:55:54,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 23:55:54,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:54,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650988538] [2025-02-07 23:55:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650988538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:55:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745885495] [2025-02-07 23:55:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:55,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:55:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:55,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:55:55,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:55:55,059 INFO L87 Difference]: Start difference. First operand 709 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:55,306 INFO L93 Difference]: Finished difference Result 1385 states and 2041 transitions. [2025-02-07 23:55:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:55:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230 [2025-02-07 23:55:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:55,309 INFO L225 Difference]: With dead ends: 1385 [2025-02-07 23:55:55,309 INFO L226 Difference]: Without dead ends: 709 [2025-02-07 23:55:55,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:55:55,313 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 941 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:55,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1645 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:55:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-07 23:55:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-02-07 23:55:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 703 states have (on average 1.4736842105263157) internal successors, (1036), 703 states have internal predecessors, (1036), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 23:55:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1044 transitions. [2025-02-07 23:55:55,327 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1044 transitions. Word has length 230 [2025-02-07 23:55:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1044 transitions. [2025-02-07 23:55:55,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1044 transitions. [2025-02-07 23:55:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-07 23:55:55,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:55,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:55:55,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 842645941, now seen corresponding path program 1 times [2025-02-07 23:55:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802158490] [2025-02-07 23:55:55,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:55,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 23:55:55,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 23:55:55,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:55,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802158490] [2025-02-07 23:55:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802158490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:55:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640789786] [2025-02-07 23:55:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:55,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:55:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:55,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:55:55,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:55:55,792 INFO L87 Difference]: Start difference. First operand 709 states and 1044 transitions. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:56,460 INFO L93 Difference]: Finished difference Result 1903 states and 2806 transitions. [2025-02-07 23:55:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:55:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230 [2025-02-07 23:55:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:56,465 INFO L225 Difference]: With dead ends: 1903 [2025-02-07 23:55:56,465 INFO L226 Difference]: Without dead ends: 1227 [2025-02-07 23:55:56,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:55:56,470 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 1140 mSDsluCounter, 3696 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 5144 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:56,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 5144 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:55:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-07 23:55:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1083. [2025-02-07 23:55:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1075 states have (on average 1.4772093023255815) internal successors, (1588), 1075 states have internal predecessors, (1588), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 23:55:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1600 transitions. [2025-02-07 23:55:56,515 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1600 transitions. Word has length 230 [2025-02-07 23:55:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1600 transitions. [2025-02-07 23:55:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1600 transitions. [2025-02-07 23:55:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-07 23:55:56,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:56,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:55:56,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1338645636, now seen corresponding path program 1 times [2025-02-07 23:55:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664202866] [2025-02-07 23:55:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-07 23:55:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-07 23:55:56,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:56,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664202866] [2025-02-07 23:55:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664202866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:55:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964999862] [2025-02-07 23:55:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:57,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:55:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:57,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:55:57,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:55:57,095 INFO L87 Difference]: Start difference. First operand 1083 states and 1600 transitions. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:57,678 INFO L93 Difference]: Finished difference Result 2666 states and 3937 transitions. [2025-02-07 23:55:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:55:57,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2025-02-07 23:55:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:57,684 INFO L225 Difference]: With dead ends: 2666 [2025-02-07 23:55:57,684 INFO L226 Difference]: Without dead ends: 1616 [2025-02-07 23:55:57,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:55:57,686 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 351 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:57,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 4058 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:55:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-02-07 23:55:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1442. [2025-02-07 23:55:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1428 states have (on average 1.4705882352941178) internal successors, (2100), 1428 states have internal predecessors, (2100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 23:55:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2124 transitions. [2025-02-07 23:55:57,714 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2124 transitions. Word has length 231 [2025-02-07 23:55:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:57,715 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2124 transitions. [2025-02-07 23:55:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2124 transitions. [2025-02-07 23:55:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 23:55:57,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:57,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:57,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:55:57,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:57,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 561119009, now seen corresponding path program 1 times [2025-02-07 23:55:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:57,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177054775] [2025-02-07 23:55:57,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:57,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 23:55:57,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 23:55:57,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:57,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177054775] [2025-02-07 23:55:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177054775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:58,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:58,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:55:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493429057] [2025-02-07 23:55:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:58,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:55:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:58,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:55:58,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:55:58,198 INFO L87 Difference]: Start difference. First operand 1442 states and 2124 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:55:58,688 INFO L93 Difference]: Finished difference Result 2666 states and 3935 transitions. [2025-02-07 23:55:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:55:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2025-02-07 23:55:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:55:58,694 INFO L225 Difference]: With dead ends: 2666 [2025-02-07 23:55:58,695 INFO L226 Difference]: Without dead ends: 1616 [2025-02-07 23:55:58,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:55:58,697 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 340 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:55:58,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 4058 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:55:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-02-07 23:55:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1474. [2025-02-07 23:55:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1460 states have (on average 1.4698630136986301) internal successors, (2146), 1460 states have internal predecessors, (2146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 23:55:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2170 transitions. [2025-02-07 23:55:58,772 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2170 transitions. Word has length 232 [2025-02-07 23:55:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:55:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2170 transitions. [2025-02-07 23:55:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:55:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2170 transitions. [2025-02-07 23:55:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 23:55:58,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:55:58,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:55:58,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:55:58,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:55:58,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:55:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash 199584793, now seen corresponding path program 1 times [2025-02-07 23:55:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:55:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496760696] [2025-02-07 23:55:58,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:55:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:55:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 23:55:58,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 23:55:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:55:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:55:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:55:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:55:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496760696] [2025-02-07 23:55:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496760696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:55:59,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:55:59,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:55:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456935780] [2025-02-07 23:55:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:55:59,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:55:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:55:59,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:55:59,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:55:59,347 INFO L87 Difference]: Start difference. First operand 1474 states and 2170 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:00,462 INFO L93 Difference]: Finished difference Result 2951 states and 4349 transitions. [2025-02-07 23:56:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:56:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2025-02-07 23:56:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:00,469 INFO L225 Difference]: With dead ends: 2951 [2025-02-07 23:56:00,470 INFO L226 Difference]: Without dead ends: 1901 [2025-02-07 23:56:00,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:00,472 INFO L435 NwaCegarLoop]: 1074 mSDtfsCounter, 194 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:00,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 5103 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 23:56:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-02-07 23:56:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1897. [2025-02-07 23:56:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1877 states have (on average 1.4672349493873202) internal successors, (2754), 1877 states have internal predecessors, (2754), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2790 transitions. [2025-02-07 23:56:00,512 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2790 transitions. Word has length 232 [2025-02-07 23:56:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:00,513 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2790 transitions. [2025-02-07 23:56:00,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2790 transitions. [2025-02-07 23:56:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:56:00,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:00,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:00,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:56:00,518 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:00,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1736398096, now seen corresponding path program 1 times [2025-02-07 23:56:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286328798] [2025-02-07 23:56:00,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:56:00,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:56:00,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:00,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286328798] [2025-02-07 23:56:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286328798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489631228] [2025-02-07 23:56:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:01,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:01,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:01,134 INFO L87 Difference]: Start difference. First operand 1897 states and 2790 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:02,016 INFO L93 Difference]: Finished difference Result 3089 states and 4553 transitions. [2025-02-07 23:56:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2025-02-07 23:56:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:02,025 INFO L225 Difference]: With dead ends: 3089 [2025-02-07 23:56:02,026 INFO L226 Difference]: Without dead ends: 2039 [2025-02-07 23:56:02,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:02,028 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 333 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:02,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 4058 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:56:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-02-07 23:56:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1913. [2025-02-07 23:56:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1893 states have (on average 1.4664553618594822) internal successors, (2776), 1893 states have internal predecessors, (2776), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2812 transitions. [2025-02-07 23:56:02,101 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2812 transitions. Word has length 233 [2025-02-07 23:56:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:02,101 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2812 transitions. [2025-02-07 23:56:02,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2812 transitions. [2025-02-07 23:56:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:56:02,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:02,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:56:02,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash -760473596, now seen corresponding path program 1 times [2025-02-07 23:56:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241924453] [2025-02-07 23:56:02,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:56:02,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:56:02,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:02,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241924453] [2025-02-07 23:56:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241924453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907702960] [2025-02-07 23:56:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:02,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:02,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:02,702 INFO L87 Difference]: Start difference. First operand 1913 states and 2812 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:03,290 INFO L93 Difference]: Finished difference Result 2971 states and 4375 transitions. [2025-02-07 23:56:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:56:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2025-02-07 23:56:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:03,297 INFO L225 Difference]: With dead ends: 2971 [2025-02-07 23:56:03,297 INFO L226 Difference]: Without dead ends: 1921 [2025-02-07 23:56:03,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:03,298 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 866 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:03,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 3259 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-02-07 23:56:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1917. [2025-02-07 23:56:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1897 states have (on average 1.4654717975751186) internal successors, (2780), 1897 states have internal predecessors, (2780), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2816 transitions. [2025-02-07 23:56:03,332 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2816 transitions. Word has length 233 [2025-02-07 23:56:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:03,333 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2816 transitions. [2025-02-07 23:56:03,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2816 transitions. [2025-02-07 23:56:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:56:03,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:03,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:03,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:56:03,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash -893827926, now seen corresponding path program 1 times [2025-02-07 23:56:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628388854] [2025-02-07 23:56:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:56:03,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:56:03,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:03,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628388854] [2025-02-07 23:56:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628388854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:04,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377579597] [2025-02-07 23:56:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:04,201 INFO L87 Difference]: Start difference. First operand 1917 states and 2816 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:04,991 INFO L93 Difference]: Finished difference Result 3897 states and 5742 transitions. [2025-02-07 23:56:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:04,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2025-02-07 23:56:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:05,000 INFO L225 Difference]: With dead ends: 3897 [2025-02-07 23:56:05,000 INFO L226 Difference]: Without dead ends: 2671 [2025-02-07 23:56:05,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:05,003 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 852 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:05,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 4147 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2025-02-07 23:56:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2061. [2025-02-07 23:56:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2041 states have (on average 1.464968152866242) internal successors, (2990), 2041 states have internal predecessors, (2990), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3026 transitions. [2025-02-07 23:56:05,040 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3026 transitions. Word has length 233 [2025-02-07 23:56:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:05,041 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3026 transitions. [2025-02-07 23:56:05,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3026 transitions. [2025-02-07 23:56:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:56:05,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:05,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:05,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:56:05,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:05,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 709174329, now seen corresponding path program 1 times [2025-02-07 23:56:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:05,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785566647] [2025-02-07 23:56:05,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:05,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:56:05,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:56:05,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:05,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:05,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:05,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785566647] [2025-02-07 23:56:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785566647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18173834] [2025-02-07 23:56:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:05,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:05,898 INFO L87 Difference]: Start difference. First operand 2061 states and 3026 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:06,546 INFO L93 Difference]: Finished difference Result 3522 states and 5180 transitions. [2025-02-07 23:56:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2025-02-07 23:56:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:06,552 INFO L225 Difference]: With dead ends: 3522 [2025-02-07 23:56:06,553 INFO L226 Difference]: Without dead ends: 2214 [2025-02-07 23:56:06,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:06,555 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 1448 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 5766 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:06,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 5766 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2025-02-07 23:56:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2070. [2025-02-07 23:56:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2050 states have (on average 1.4629268292682926) internal successors, (2999), 2050 states have internal predecessors, (2999), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 3035 transitions. [2025-02-07 23:56:06,590 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 3035 transitions. Word has length 233 [2025-02-07 23:56:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:06,590 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 3035 transitions. [2025-02-07 23:56:06,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 3035 transitions. [2025-02-07 23:56:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-07 23:56:06,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:06,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:56:06,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1228482501, now seen corresponding path program 1 times [2025-02-07 23:56:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591051156] [2025-02-07 23:56:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:06,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-07 23:56:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-07 23:56:06,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:06,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591051156] [2025-02-07 23:56:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591051156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:07,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200212977] [2025-02-07 23:56:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:07,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:07,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:07,361 INFO L87 Difference]: Start difference. First operand 2070 states and 3035 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:07,826 INFO L93 Difference]: Finished difference Result 3717 states and 5465 transitions. [2025-02-07 23:56:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:56:07,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2025-02-07 23:56:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:07,832 INFO L225 Difference]: With dead ends: 3717 [2025-02-07 23:56:07,832 INFO L226 Difference]: Without dead ends: 2070 [2025-02-07 23:56:07,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:07,835 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 1670 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:07,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 2424 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-02-07 23:56:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2025-02-07 23:56:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2050 states have (on average 1.46) internal successors, (2993), 2050 states have internal predecessors, (2993), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 3029 transitions. [2025-02-07 23:56:07,868 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 3029 transitions. Word has length 233 [2025-02-07 23:56:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:07,868 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 3029 transitions. [2025-02-07 23:56:07,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 3029 transitions. [2025-02-07 23:56:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 23:56:07,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:07,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:07,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:56:07,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:07,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash 243207462, now seen corresponding path program 1 times [2025-02-07 23:56:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100869509] [2025-02-07 23:56:07,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 23:56:07,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 23:56:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100869509] [2025-02-07 23:56:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100869509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585795834] [2025-02-07 23:56:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:08,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:08,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:08,703 INFO L87 Difference]: Start difference. First operand 2070 states and 3029 transitions. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:09,661 INFO L93 Difference]: Finished difference Result 3961 states and 5819 transitions. [2025-02-07 23:56:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2025-02-07 23:56:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:09,670 INFO L225 Difference]: With dead ends: 3961 [2025-02-07 23:56:09,673 INFO L226 Difference]: Without dead ends: 2692 [2025-02-07 23:56:09,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:09,675 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1822 mSDsluCounter, 5551 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 6350 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:09,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 6350 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:56:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-02-07 23:56:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2079. [2025-02-07 23:56:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2059 states have (on average 1.4594463331714425) internal successors, (3005), 2059 states have internal predecessors, (3005), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3041 transitions. [2025-02-07 23:56:09,703 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3041 transitions. Word has length 234 [2025-02-07 23:56:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:09,703 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3041 transitions. [2025-02-07 23:56:09,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3041 transitions. [2025-02-07 23:56:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-07 23:56:09,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:09,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:09,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:56:09,707 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:09,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1485411702, now seen corresponding path program 1 times [2025-02-07 23:56:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931910219] [2025-02-07 23:56:09,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:09,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-07 23:56:09,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-07 23:56:09,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:09,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931910219] [2025-02-07 23:56:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931910219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:09,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:56:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405520646] [2025-02-07 23:56:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:56:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:09,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:56:09,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:09,986 INFO L87 Difference]: Start difference. First operand 2079 states and 3041 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:10,235 INFO L93 Difference]: Finished difference Result 3562 states and 5225 transitions. [2025-02-07 23:56:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:56:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2025-02-07 23:56:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:10,243 INFO L225 Difference]: With dead ends: 3562 [2025-02-07 23:56:10,243 INFO L226 Difference]: Without dead ends: 2106 [2025-02-07 23:56:10,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:10,245 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:10,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2460 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:56:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2025-02-07 23:56:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2106. [2025-02-07 23:56:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2086 states have (on average 1.4563758389261745) internal successors, (3038), 2086 states have internal predecessors, (3038), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3074 transitions. [2025-02-07 23:56:10,280 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3074 transitions. Word has length 235 [2025-02-07 23:56:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:10,281 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 3074 transitions. [2025-02-07 23:56:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3074 transitions. [2025-02-07 23:56:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-07 23:56:10,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:10,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:10,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 23:56:10,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -773657595, now seen corresponding path program 1 times [2025-02-07 23:56:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773990868] [2025-02-07 23:56:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:10,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-07 23:56:10,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-07 23:56:10,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:10,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773990868] [2025-02-07 23:56:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773990868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911499632] [2025-02-07 23:56:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:10,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:10,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:10,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:10,810 INFO L87 Difference]: Start difference. First operand 2106 states and 3074 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:11,362 INFO L93 Difference]: Finished difference Result 3986 states and 5843 transitions. [2025-02-07 23:56:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2025-02-07 23:56:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:11,371 INFO L225 Difference]: With dead ends: 3986 [2025-02-07 23:56:11,371 INFO L226 Difference]: Without dead ends: 2713 [2025-02-07 23:56:11,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:11,373 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 844 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:11,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 4141 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-07 23:56:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2127. [2025-02-07 23:56:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2107 states have (on average 1.4546748932130993) internal successors, (3065), 2107 states have internal predecessors, (3065), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 23:56:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3101 transitions. [2025-02-07 23:56:11,412 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3101 transitions. Word has length 235 [2025-02-07 23:56:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 3101 transitions. [2025-02-07 23:56:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3101 transitions. [2025-02-07 23:56:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-07 23:56:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:11,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:56:11,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1161213473, now seen corresponding path program 1 times [2025-02-07 23:56:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:11,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558982147] [2025-02-07 23:56:11,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:11,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-07 23:56:11,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-07 23:56:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558982147] [2025-02-07 23:56:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558982147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22747619] [2025-02-07 23:56:11,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:11,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:11,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:11,994 INFO L87 Difference]: Start difference. First operand 2127 states and 3101 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:12,605 INFO L93 Difference]: Finished difference Result 3893 states and 5687 transitions. [2025-02-07 23:56:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2025-02-07 23:56:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:12,611 INFO L225 Difference]: With dead ends: 3893 [2025-02-07 23:56:12,611 INFO L226 Difference]: Without dead ends: 2709 [2025-02-07 23:56:12,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:12,613 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1433 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:12,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 3737 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-02-07 23:56:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2531. [2025-02-07 23:56:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2505 states have (on average 1.4502994011976047) internal successors, (3633), 2505 states have internal predecessors, (3633), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3681 transitions. [2025-02-07 23:56:12,640 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3681 transitions. Word has length 235 [2025-02-07 23:56:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:12,640 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3681 transitions. [2025-02-07 23:56:12,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3681 transitions. [2025-02-07 23:56:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-07 23:56:12,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:12,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:12,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 23:56:12,643 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1918557918, now seen corresponding path program 1 times [2025-02-07 23:56:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055970118] [2025-02-07 23:56:12,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:12,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 23:56:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 23:56:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:12,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055970118] [2025-02-07 23:56:12,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055970118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:12,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:12,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624513598] [2025-02-07 23:56:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:13,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:13,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:13,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:13,000 INFO L87 Difference]: Start difference. First operand 2531 states and 3681 transitions. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:13,438 INFO L93 Difference]: Finished difference Result 3785 states and 5523 transitions. [2025-02-07 23:56:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:13,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236 [2025-02-07 23:56:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:13,445 INFO L225 Difference]: With dead ends: 3785 [2025-02-07 23:56:13,445 INFO L226 Difference]: Without dead ends: 2661 [2025-02-07 23:56:13,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:13,448 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 320 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:13,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 4055 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-02-07 23:56:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2567. [2025-02-07 23:56:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2541 states have (on average 1.4494293585202676) internal successors, (3683), 2541 states have internal predecessors, (3683), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3731 transitions. [2025-02-07 23:56:13,475 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3731 transitions. Word has length 236 [2025-02-07 23:56:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 3731 transitions. [2025-02-07 23:56:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3731 transitions. [2025-02-07 23:56:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-07 23:56:13,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:13,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:13,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 23:56:13,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:13,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 374897958, now seen corresponding path program 1 times [2025-02-07 23:56:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525845605] [2025-02-07 23:56:13,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:13,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-07 23:56:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-07 23:56:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525845605] [2025-02-07 23:56:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525845605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312591697] [2025-02-07 23:56:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:13,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:13,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:13,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:13,974 INFO L87 Difference]: Start difference. First operand 2567 states and 3731 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:14,570 INFO L93 Difference]: Finished difference Result 3897 states and 5685 transitions. [2025-02-07 23:56:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236 [2025-02-07 23:56:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:14,575 INFO L225 Difference]: With dead ends: 3897 [2025-02-07 23:56:14,575 INFO L226 Difference]: Without dead ends: 2745 [2025-02-07 23:56:14,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:14,577 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1550 mSDsluCounter, 2976 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 3732 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:14,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 3732 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2025-02-07 23:56:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2599. [2025-02-07 23:56:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2573 states have (on average 1.4485036921881074) internal successors, (3727), 2573 states have internal predecessors, (3727), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3775 transitions. [2025-02-07 23:56:14,600 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3775 transitions. Word has length 236 [2025-02-07 23:56:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3775 transitions. [2025-02-07 23:56:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3775 transitions. [2025-02-07 23:56:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-07 23:56:14,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:14,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 23:56:14,604 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash -793531119, now seen corresponding path program 1 times [2025-02-07 23:56:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:14,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863077913] [2025-02-07 23:56:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:14,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 23:56:14,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 23:56:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863077913] [2025-02-07 23:56:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863077913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120904894] [2025-02-07 23:56:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:14,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:14,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:14,917 INFO L87 Difference]: Start difference. First operand 2599 states and 3775 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:15,373 INFO L93 Difference]: Finished difference Result 3817 states and 5565 transitions. [2025-02-07 23:56:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2025-02-07 23:56:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:15,378 INFO L225 Difference]: With dead ends: 3817 [2025-02-07 23:56:15,378 INFO L226 Difference]: Without dead ends: 2693 [2025-02-07 23:56:15,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:15,380 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 314 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:15,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 4047 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-02-07 23:56:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2615. [2025-02-07 23:56:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2589 states have (on average 1.4480494399382) internal successors, (3749), 2589 states have internal predecessors, (3749), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3797 transitions. [2025-02-07 23:56:15,414 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3797 transitions. Word has length 237 [2025-02-07 23:56:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:15,415 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 3797 transitions. [2025-02-07 23:56:15,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3797 transitions. [2025-02-07 23:56:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-07 23:56:15,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:15,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 23:56:15,419 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 258512811, now seen corresponding path program 1 times [2025-02-07 23:56:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826859371] [2025-02-07 23:56:15,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:15,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 23:56:15,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 23:56:15,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826859371] [2025-02-07 23:56:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826859371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899865332] [2025-02-07 23:56:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:16,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:16,066 INFO L87 Difference]: Start difference. First operand 2615 states and 3797 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:16,769 INFO L93 Difference]: Finished difference Result 4283 states and 6241 transitions. [2025-02-07 23:56:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 237 [2025-02-07 23:56:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:16,773 INFO L225 Difference]: With dead ends: 4283 [2025-02-07 23:56:16,773 INFO L226 Difference]: Without dead ends: 2615 [2025-02-07 23:56:16,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:16,775 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 2537 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 4796 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:16,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 4796 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2025-02-07 23:56:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2615. [2025-02-07 23:56:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2589 states have (on average 1.4418694476631904) internal successors, (3733), 2589 states have internal predecessors, (3733), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3781 transitions. [2025-02-07 23:56:16,829 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3781 transitions. Word has length 237 [2025-02-07 23:56:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 3781 transitions. [2025-02-07 23:56:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3781 transitions. [2025-02-07 23:56:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-07 23:56:16,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:16,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 23:56:16,832 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 404725997, now seen corresponding path program 1 times [2025-02-07 23:56:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197048480] [2025-02-07 23:56:16,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:16,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-07 23:56:16,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-07 23:56:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197048480] [2025-02-07 23:56:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197048480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:17,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:56:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354194544] [2025-02-07 23:56:17,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:17,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:56:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:17,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:56:17,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:17,061 INFO L87 Difference]: Start difference. First operand 2615 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:17,393 INFO L93 Difference]: Finished difference Result 4275 states and 6205 transitions. [2025-02-07 23:56:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:56:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2025-02-07 23:56:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:17,401 INFO L225 Difference]: With dead ends: 4275 [2025-02-07 23:56:17,401 INFO L226 Difference]: Without dead ends: 2655 [2025-02-07 23:56:17,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:17,403 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 2 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:17,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3269 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:56:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-02-07 23:56:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2647. [2025-02-07 23:56:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2621 states have (on average 1.4395268981304845) internal successors, (3773), 2621 states have internal predecessors, (3773), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3821 transitions. [2025-02-07 23:56:17,424 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3821 transitions. Word has length 238 [2025-02-07 23:56:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:17,425 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 3821 transitions. [2025-02-07 23:56:17,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3821 transitions. [2025-02-07 23:56:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-07 23:56:17,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:17,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:17,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 23:56:17,428 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1526163491, now seen corresponding path program 1 times [2025-02-07 23:56:17,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:17,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037556624] [2025-02-07 23:56:17,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:17,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:17,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-07 23:56:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-07 23:56:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037556624] [2025-02-07 23:56:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037556624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218469935] [2025-02-07 23:56:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:17,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:17,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:17,891 INFO L87 Difference]: Start difference. First operand 2647 states and 3821 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:18,480 INFO L93 Difference]: Finished difference Result 3937 states and 5709 transitions. [2025-02-07 23:56:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:18,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2025-02-07 23:56:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:18,486 INFO L225 Difference]: With dead ends: 3937 [2025-02-07 23:56:18,486 INFO L226 Difference]: Without dead ends: 2793 [2025-02-07 23:56:18,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:18,488 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1264 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:18,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 3742 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-02-07 23:56:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2663. [2025-02-07 23:56:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2637 states have (on average 1.4383769434963973) internal successors, (3793), 2637 states have internal predecessors, (3793), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3841 transitions. [2025-02-07 23:56:18,521 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3841 transitions. Word has length 238 [2025-02-07 23:56:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3841 transitions. [2025-02-07 23:56:18,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3841 transitions. [2025-02-07 23:56:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-07 23:56:18,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:18,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 23:56:18,526 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1989817222, now seen corresponding path program 1 times [2025-02-07 23:56:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027793379] [2025-02-07 23:56:18,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-07 23:56:18,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-07 23:56:18,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:18,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027793379] [2025-02-07 23:56:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027793379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:19,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:19,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:19,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356754639] [2025-02-07 23:56:19,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:19,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:19,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:19,019 INFO L87 Difference]: Start difference. First operand 2663 states and 3841 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:19,645 INFO L93 Difference]: Finished difference Result 3873 states and 5613 transitions. [2025-02-07 23:56:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2025-02-07 23:56:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:19,651 INFO L225 Difference]: With dead ends: 3873 [2025-02-07 23:56:19,651 INFO L226 Difference]: Without dead ends: 2741 [2025-02-07 23:56:19,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:19,654 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 306 mSDsluCounter, 3233 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:19,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 4042 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-02-07 23:56:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2679. [2025-02-07 23:56:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2679 states, 2653 states have (on average 1.437994722955145) internal successors, (3815), 2653 states have internal predecessors, (3815), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 3863 transitions. [2025-02-07 23:56:19,694 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 3863 transitions. Word has length 239 [2025-02-07 23:56:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 2679 states and 3863 transitions. [2025-02-07 23:56:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 3863 transitions. [2025-02-07 23:56:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-07 23:56:19,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:19,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:19,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 23:56:19,699 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:19,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash 824649418, now seen corresponding path program 1 times [2025-02-07 23:56:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738521651] [2025-02-07 23:56:19,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:19,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-07 23:56:19,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-07 23:56:19,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:19,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738521651] [2025-02-07 23:56:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738521651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:56:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156920383] [2025-02-07 23:56:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:56:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:56:20,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:20,521 INFO L87 Difference]: Start difference. First operand 2679 states and 3863 transitions. Second operand has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:21,223 INFO L93 Difference]: Finished difference Result 4057 states and 5887 transitions. [2025-02-07 23:56:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2025-02-07 23:56:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:21,227 INFO L225 Difference]: With dead ends: 4057 [2025-02-07 23:56:21,227 INFO L226 Difference]: Without dead ends: 2925 [2025-02-07 23:56:21,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:21,229 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1069 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:21,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 3782 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2025-02-07 23:56:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2923. [2025-02-07 23:56:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2897 states have (on average 1.4425267518122196) internal successors, (4179), 2897 states have internal predecessors, (4179), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4227 transitions. [2025-02-07 23:56:21,297 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4227 transitions. Word has length 239 [2025-02-07 23:56:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 2923 states and 4227 transitions. [2025-02-07 23:56:21,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4227 transitions. [2025-02-07 23:56:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-07 23:56:21,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:21,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 23:56:21,303 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:21,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -425531773, now seen corresponding path program 1 times [2025-02-07 23:56:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139096230] [2025-02-07 23:56:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:21,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-07 23:56:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-07 23:56:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139096230] [2025-02-07 23:56:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139096230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:21,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773588002] [2025-02-07 23:56:21,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:21,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:21,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:21,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:21,925 INFO L87 Difference]: Start difference. First operand 2923 states and 4227 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:22,535 INFO L93 Difference]: Finished difference Result 4429 states and 6439 transitions. [2025-02-07 23:56:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:22,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 240 [2025-02-07 23:56:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:22,539 INFO L225 Difference]: With dead ends: 4429 [2025-02-07 23:56:22,539 INFO L226 Difference]: Without dead ends: 3053 [2025-02-07 23:56:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:22,541 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1398 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 3740 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-02-07 23:56:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2959. [2025-02-07 23:56:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2933 states have (on average 1.4418683941356973) internal successors, (4229), 2933 states have internal predecessors, (4229), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4277 transitions. [2025-02-07 23:56:22,588 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4277 transitions. Word has length 240 [2025-02-07 23:56:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:22,589 INFO L471 AbstractCegarLoop]: Abstraction has 2959 states and 4277 transitions. [2025-02-07 23:56:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4277 transitions. [2025-02-07 23:56:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-07 23:56:22,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:22,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:22,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 23:56:22,596 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -869717752, now seen corresponding path program 1 times [2025-02-07 23:56:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978042921] [2025-02-07 23:56:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:22,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-07 23:56:22,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-07 23:56:22,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:22,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978042921] [2025-02-07 23:56:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978042921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:56:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972529142] [2025-02-07 23:56:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:56:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:23,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:56:23,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:56:23,503 INFO L87 Difference]: Start difference. First operand 2959 states and 4277 transitions. Second operand has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:24,491 INFO L93 Difference]: Finished difference Result 4963 states and 7207 transitions. [2025-02-07 23:56:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:56:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 241 [2025-02-07 23:56:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:24,495 INFO L225 Difference]: With dead ends: 4963 [2025-02-07 23:56:24,495 INFO L226 Difference]: Without dead ends: 2999 [2025-02-07 23:56:24,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:56:24,497 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 2560 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2560 SdHoareTripleChecker+Valid, 5595 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:24,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2560 Valid, 5595 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:56:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2025-02-07 23:56:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2975. [2025-02-07 23:56:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2949 states have (on average 1.439471007121058) internal successors, (4245), 2949 states have internal predecessors, (4245), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4293 transitions. [2025-02-07 23:56:24,557 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4293 transitions. Word has length 241 [2025-02-07 23:56:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4293 transitions. [2025-02-07 23:56:24,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4293 transitions. [2025-02-07 23:56:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 23:56:24,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:24,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:24,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 23:56:24,562 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:24,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1921174763, now seen corresponding path program 1 times [2025-02-07 23:56:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189356520] [2025-02-07 23:56:24,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:24,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 23:56:24,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 23:56:24,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189356520] [2025-02-07 23:56:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189356520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:25,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652855611] [2025-02-07 23:56:25,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:25,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:25,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:25,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:25,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:25,087 INFO L87 Difference]: Start difference. First operand 2975 states and 4293 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:25,652 INFO L93 Difference]: Finished difference Result 5453 states and 7922 transitions. [2025-02-07 23:56:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:25,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242 [2025-02-07 23:56:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:25,656 INFO L225 Difference]: With dead ends: 5453 [2025-02-07 23:56:25,656 INFO L226 Difference]: Without dead ends: 3815 [2025-02-07 23:56:25,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:25,658 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 836 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:25,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 4856 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2025-02-07 23:56:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3011. [2025-02-07 23:56:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 2985 states have (on average 1.4381909547738694) internal successors, (4293), 2985 states have internal predecessors, (4293), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 4341 transitions. [2025-02-07 23:56:25,690 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 4341 transitions. Word has length 242 [2025-02-07 23:56:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:25,691 INFO L471 AbstractCegarLoop]: Abstraction has 3011 states and 4341 transitions. [2025-02-07 23:56:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 4341 transitions. [2025-02-07 23:56:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 23:56:25,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:25,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:25,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 23:56:25,694 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:25,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 596833291, now seen corresponding path program 1 times [2025-02-07 23:56:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782561168] [2025-02-07 23:56:25,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 23:56:25,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 23:56:25,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:25,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782561168] [2025-02-07 23:56:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782561168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:26,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271479400] [2025-02-07 23:56:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:26,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:26,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:26,026 INFO L87 Difference]: Start difference. First operand 3011 states and 4341 transitions. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:26,535 INFO L93 Difference]: Finished difference Result 4462 states and 6469 transitions. [2025-02-07 23:56:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242 [2025-02-07 23:56:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:26,538 INFO L225 Difference]: With dead ends: 4462 [2025-02-07 23:56:26,539 INFO L226 Difference]: Without dead ends: 3073 [2025-02-07 23:56:26,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:26,540 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 299 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:26,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 4050 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2025-02-07 23:56:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3027. [2025-02-07 23:56:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3001 states have (on average 1.4378540486504499) internal successors, (4315), 3001 states have internal predecessors, (4315), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4363 transitions. [2025-02-07 23:56:26,564 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4363 transitions. Word has length 242 [2025-02-07 23:56:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:26,564 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4363 transitions. [2025-02-07 23:56:26,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4363 transitions. [2025-02-07 23:56:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 23:56:26,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:26,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 23:56:26,568 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash -450226949, now seen corresponding path program 1 times [2025-02-07 23:56:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328182569] [2025-02-07 23:56:26,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:26,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:26,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 23:56:26,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 23:56:26,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:26,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:27,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:27,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328182569] [2025-02-07 23:56:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328182569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646733578] [2025-02-07 23:56:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:27,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:27,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:27,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:27,307 INFO L87 Difference]: Start difference. First operand 3027 states and 4363 transitions. Second operand has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:28,179 INFO L93 Difference]: Finished difference Result 4996 states and 7235 transitions. [2025-02-07 23:56:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 242 [2025-02-07 23:56:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:28,182 INFO L225 Difference]: With dead ends: 4996 [2025-02-07 23:56:28,182 INFO L226 Difference]: Without dead ends: 3027 [2025-02-07 23:56:28,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:28,184 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 2527 mSDsluCounter, 4023 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:28,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 4791 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:56:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-02-07 23:56:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 3027. [2025-02-07 23:56:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3001 states have (on average 1.432522492502499) internal successors, (4299), 3001 states have internal predecessors, (4299), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4347 transitions. [2025-02-07 23:56:28,210 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4347 transitions. Word has length 242 [2025-02-07 23:56:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:28,210 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4347 transitions. [2025-02-07 23:56:28,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4347 transitions. [2025-02-07 23:56:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-07 23:56:28,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:28,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 23:56:28,213 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -869306029, now seen corresponding path program 1 times [2025-02-07 23:56:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356165958] [2025-02-07 23:56:28,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:28,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-07 23:56:28,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-07 23:56:28,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:28,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356165958] [2025-02-07 23:56:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356165958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330581943] [2025-02-07 23:56:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:28,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:28,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:28,850 INFO L87 Difference]: Start difference. First operand 3027 states and 4347 transitions. Second operand has 10 states, 10 states have (on average 23.6) internal successors, (236), 10 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:29,631 INFO L93 Difference]: Finished difference Result 5498 states and 7960 transitions. [2025-02-07 23:56:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.6) internal successors, (236), 10 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243 [2025-02-07 23:56:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:29,635 INFO L225 Difference]: With dead ends: 5498 [2025-02-07 23:56:29,635 INFO L226 Difference]: Without dead ends: 3855 [2025-02-07 23:56:29,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:29,638 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 2391 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:29,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 5679 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2025-02-07 23:56:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3039. [2025-02-07 23:56:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3013 states have (on average 1.4321274477265185) internal successors, (4315), 3013 states have internal predecessors, (4315), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4363 transitions. [2025-02-07 23:56:29,664 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4363 transitions. Word has length 243 [2025-02-07 23:56:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 4363 transitions. [2025-02-07 23:56:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.6) internal successors, (236), 10 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4363 transitions. [2025-02-07 23:56:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-07 23:56:29,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:29,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:29,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 23:56:29,668 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 588710624, now seen corresponding path program 1 times [2025-02-07 23:56:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858647662] [2025-02-07 23:56:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:29,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-07 23:56:29,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-07 23:56:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858647662] [2025-02-07 23:56:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858647662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070384831] [2025-02-07 23:56:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:30,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:30,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:30,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:30,111 INFO L87 Difference]: Start difference. First operand 3039 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:30,677 INFO L93 Difference]: Finished difference Result 5481 states and 7930 transitions. [2025-02-07 23:56:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2025-02-07 23:56:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:30,681 INFO L225 Difference]: With dead ends: 5481 [2025-02-07 23:56:30,682 INFO L226 Difference]: Without dead ends: 3847 [2025-02-07 23:56:30,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:30,684 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 828 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:30,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 4855 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2025-02-07 23:56:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3067. [2025-02-07 23:56:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3041 states have (on average 1.4307793488983886) internal successors, (4351), 3041 states have internal predecessors, (4351), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4399 transitions. [2025-02-07 23:56:30,709 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4399 transitions. Word has length 244 [2025-02-07 23:56:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:30,709 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4399 transitions. [2025-02-07 23:56:30,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4399 transitions. [2025-02-07 23:56:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-07 23:56:30,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:30,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 23:56:30,712 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:30,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1247063110, now seen corresponding path program 1 times [2025-02-07 23:56:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351383407] [2025-02-07 23:56:30,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:30,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-07 23:56:30,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-07 23:56:30,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351383407] [2025-02-07 23:56:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351383407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706549465] [2025-02-07 23:56:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:31,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:31,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:31,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:31,200 INFO L87 Difference]: Start difference. First operand 3067 states and 4399 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:31,796 INFO L93 Difference]: Finished difference Result 4560 states and 6584 transitions. [2025-02-07 23:56:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2025-02-07 23:56:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:31,800 INFO L225 Difference]: With dead ends: 4560 [2025-02-07 23:56:31,800 INFO L226 Difference]: Without dead ends: 3161 [2025-02-07 23:56:31,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:31,802 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1241 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:31,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 3740 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2025-02-07 23:56:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 3083. [2025-02-07 23:56:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3057 states have (on average 1.4304874059535493) internal successors, (4373), 3057 states have internal predecessors, (4373), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4421 transitions. [2025-02-07 23:56:31,824 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4421 transitions. Word has length 244 [2025-02-07 23:56:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 4421 transitions. [2025-02-07 23:56:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4421 transitions. [2025-02-07 23:56:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-07 23:56:31,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:31,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 23:56:31,830 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -910853649, now seen corresponding path program 1 times [2025-02-07 23:56:31,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:31,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623665567] [2025-02-07 23:56:31,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:31,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 23:56:31,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 23:56:31,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:31,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623665567] [2025-02-07 23:56:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623665567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516648525] [2025-02-07 23:56:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:32,172 INFO L87 Difference]: Start difference. First operand 3083 states and 4421 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:32,648 INFO L93 Difference]: Finished difference Result 4528 states and 6534 transitions. [2025-02-07 23:56:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:32,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2025-02-07 23:56:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:32,653 INFO L225 Difference]: With dead ends: 4528 [2025-02-07 23:56:32,653 INFO L226 Difference]: Without dead ends: 3129 [2025-02-07 23:56:32,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:32,656 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 290 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:32,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 4045 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-02-07 23:56:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3099. [2025-02-07 23:56:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3073 states have (on average 1.4301985030914417) internal successors, (4395), 3073 states have internal predecessors, (4395), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4443 transitions. [2025-02-07 23:56:32,697 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4443 transitions. Word has length 245 [2025-02-07 23:56:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:32,697 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4443 transitions. [2025-02-07 23:56:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4443 transitions. [2025-02-07 23:56:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-07 23:56:32,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:32,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:32,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 23:56:32,702 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:32,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1089487403, now seen corresponding path program 1 times [2025-02-07 23:56:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465220509] [2025-02-07 23:56:32,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:32,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 23:56:32,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 23:56:32,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465220509] [2025-02-07 23:56:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465220509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728969607] [2025-02-07 23:56:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:33,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:33,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:33,217 INFO L87 Difference]: Start difference. First operand 3099 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:33,824 INFO L93 Difference]: Finished difference Result 4576 states and 6604 transitions. [2025-02-07 23:56:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2025-02-07 23:56:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:33,827 INFO L225 Difference]: With dead ends: 4576 [2025-02-07 23:56:33,827 INFO L226 Difference]: Without dead ends: 3177 [2025-02-07 23:56:33,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:33,829 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1377 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:33,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 3735 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2025-02-07 23:56:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3115. [2025-02-07 23:56:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 3089 states have (on average 1.4299125930721917) internal successors, (4417), 3089 states have internal predecessors, (4417), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4465 transitions. [2025-02-07 23:56:33,850 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4465 transitions. Word has length 245 [2025-02-07 23:56:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:33,851 INFO L471 AbstractCegarLoop]: Abstraction has 3115 states and 4465 transitions. [2025-02-07 23:56:33,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4465 transitions. [2025-02-07 23:56:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-07 23:56:33,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:33,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:33,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 23:56:33,853 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:33,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:33,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2056673280, now seen corresponding path program 1 times [2025-02-07 23:56:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:33,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709310372] [2025-02-07 23:56:33,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:33,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-07 23:56:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-07 23:56:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:34,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709310372] [2025-02-07 23:56:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709310372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:34,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:34,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045224334] [2025-02-07 23:56:34,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:34,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:34,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:34,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:34,167 INFO L87 Difference]: Start difference. First operand 3115 states and 4465 transitions. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:34,515 INFO L93 Difference]: Finished difference Result 4544 states and 6554 transitions. [2025-02-07 23:56:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 246 [2025-02-07 23:56:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:34,518 INFO L225 Difference]: With dead ends: 4544 [2025-02-07 23:56:34,518 INFO L226 Difference]: Without dead ends: 3145 [2025-02-07 23:56:34,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:34,520 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 284 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:34,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 4045 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:56:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-02-07 23:56:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3131. [2025-02-07 23:56:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3105 states have (on average 1.4296296296296296) internal successors, (4439), 3105 states have internal predecessors, (4439), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4487 transitions. [2025-02-07 23:56:34,543 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4487 transitions. Word has length 246 [2025-02-07 23:56:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 4487 transitions. [2025-02-07 23:56:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4487 transitions. [2025-02-07 23:56:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-07 23:56:34,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:34,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:34,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 23:56:34,546 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2019248304, now seen corresponding path program 1 times [2025-02-07 23:56:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:34,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475345380] [2025-02-07 23:56:34,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:34,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:34,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-07 23:56:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-07 23:56:34,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:34,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475345380] [2025-02-07 23:56:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475345380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025595192] [2025-02-07 23:56:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:35,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:35,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:35,172 INFO L87 Difference]: Start difference. First operand 3131 states and 4487 transitions. Second operand has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:35,915 INFO L93 Difference]: Finished difference Result 5126 states and 7384 transitions. [2025-02-07 23:56:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 246 [2025-02-07 23:56:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:35,918 INFO L225 Difference]: With dead ends: 5126 [2025-02-07 23:56:35,918 INFO L226 Difference]: Without dead ends: 3131 [2025-02-07 23:56:35,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:35,920 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1770 mSDsluCounter, 4024 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:35,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 4791 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-02-07 23:56:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3131. [2025-02-07 23:56:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3105 states have (on average 1.4270531400966184) internal successors, (4431), 3105 states have internal predecessors, (4431), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4479 transitions. [2025-02-07 23:56:35,942 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4479 transitions. Word has length 246 [2025-02-07 23:56:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:35,942 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 4479 transitions. [2025-02-07 23:56:35,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4479 transitions. [2025-02-07 23:56:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 23:56:35,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:35,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:35,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 23:56:35,944 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:35,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1907870174, now seen corresponding path program 1 times [2025-02-07 23:56:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:35,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570029584] [2025-02-07 23:56:35,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 23:56:35,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 23:56:35,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:35,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:36,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570029584] [2025-02-07 23:56:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570029584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:56:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231489226] [2025-02-07 23:56:36,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:36,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:56:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:36,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:56:36,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:36,144 INFO L87 Difference]: Start difference. First operand 3131 states and 4479 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:36,454 INFO L93 Difference]: Finished difference Result 5118 states and 7358 transitions. [2025-02-07 23:56:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:56:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2025-02-07 23:56:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:36,457 INFO L225 Difference]: With dead ends: 5118 [2025-02-07 23:56:36,457 INFO L226 Difference]: Without dead ends: 3171 [2025-02-07 23:56:36,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:36,459 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:36,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3261 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:56:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2025-02-07 23:56:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3163. [2025-02-07 23:56:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 3137 states have (on average 1.42524705132292) internal successors, (4471), 3137 states have internal predecessors, (4471), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4519 transitions. [2025-02-07 23:56:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4519 transitions. Word has length 247 [2025-02-07 23:56:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:36,480 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 4519 transitions. [2025-02-07 23:56:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4519 transitions. [2025-02-07 23:56:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 23:56:36,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:36,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:36,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 23:56:36,482 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:36,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1445066119, now seen corresponding path program 1 times [2025-02-07 23:56:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970214767] [2025-02-07 23:56:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:36,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 23:56:36,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 23:56:36,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:36,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:36,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970214767] [2025-02-07 23:56:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970214767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:56:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375913660] [2025-02-07 23:56:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:56:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:36,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:56:36,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:36,777 INFO L87 Difference]: Start difference. First operand 3163 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:36,985 INFO L93 Difference]: Finished difference Result 5253 states and 7535 transitions. [2025-02-07 23:56:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:56:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2025-02-07 23:56:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:36,988 INFO L225 Difference]: With dead ends: 5253 [2025-02-07 23:56:36,988 INFO L226 Difference]: Without dead ends: 3199 [2025-02-07 23:56:36,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:36,990 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 0 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:36,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2454 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:56:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2025-02-07 23:56:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3199. [2025-02-07 23:56:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3199 states, 3173 states have (on average 1.4204223132682003) internal successors, (4507), 3173 states have internal predecessors, (4507), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4555 transitions. [2025-02-07 23:56:37,016 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4555 transitions. Word has length 247 [2025-02-07 23:56:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:37,016 INFO L471 AbstractCegarLoop]: Abstraction has 3199 states and 4555 transitions. [2025-02-07 23:56:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4555 transitions. [2025-02-07 23:56:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 23:56:37,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:37,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 23:56:37,019 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 921295922, now seen corresponding path program 1 times [2025-02-07 23:56:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150487432] [2025-02-07 23:56:37,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:37,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 23:56:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 23:56:37,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:37,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150487432] [2025-02-07 23:56:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150487432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:56:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168531716] [2025-02-07 23:56:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:56:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:56:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:56:37,800 INFO L87 Difference]: Start difference. First operand 3199 states and 4555 transitions. Second operand has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:38,689 INFO L93 Difference]: Finished difference Result 5227 states and 7493 transitions. [2025-02-07 23:56:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:56:38,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 247 [2025-02-07 23:56:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:38,693 INFO L225 Difference]: With dead ends: 5227 [2025-02-07 23:56:38,693 INFO L226 Difference]: Without dead ends: 3239 [2025-02-07 23:56:38,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:56:38,695 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2536 mSDsluCounter, 4828 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 5586 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:38,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 5586 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2025-02-07 23:56:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3215. [2025-02-07 23:56:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3189 states have (on average 1.418312950768266) internal successors, (4523), 3189 states have internal predecessors, (4523), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4571 transitions. [2025-02-07 23:56:38,731 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4571 transitions. Word has length 247 [2025-02-07 23:56:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:38,732 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 4571 transitions. [2025-02-07 23:56:38,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4571 transitions. [2025-02-07 23:56:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-07 23:56:38,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:38,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:38,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 23:56:38,734 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1401349536, now seen corresponding path program 1 times [2025-02-07 23:56:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665872089] [2025-02-07 23:56:38,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:38,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-07 23:56:38,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-07 23:56:38,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:38,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665872089] [2025-02-07 23:56:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665872089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:39,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307073850] [2025-02-07 23:56:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:39,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:39,178 INFO L87 Difference]: Start difference. First operand 3215 states and 4571 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:39,712 INFO L93 Difference]: Finished difference Result 5701 states and 8184 transitions. [2025-02-07 23:56:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248 [2025-02-07 23:56:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:39,716 INFO L225 Difference]: With dead ends: 5701 [2025-02-07 23:56:39,717 INFO L226 Difference]: Without dead ends: 4031 [2025-02-07 23:56:39,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:39,719 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 820 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:39,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 4147 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2025-02-07 23:56:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3251. [2025-02-07 23:56:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 3225 states have (on average 1.4173643410852714) internal successors, (4571), 3225 states have internal predecessors, (4571), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4619 transitions. [2025-02-07 23:56:39,749 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4619 transitions. Word has length 248 [2025-02-07 23:56:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:39,749 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 4619 transitions. [2025-02-07 23:56:39,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4619 transitions. [2025-02-07 23:56:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-07 23:56:39,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:39,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 23:56:39,752 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:39,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -340969035, now seen corresponding path program 1 times [2025-02-07 23:56:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402829665] [2025-02-07 23:56:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:39,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-07 23:56:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-07 23:56:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:40,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402829665] [2025-02-07 23:56:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402829665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600567297] [2025-02-07 23:56:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:40,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:40,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:40,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:40,336 INFO L87 Difference]: Start difference. First operand 3251 states and 4619 transitions. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:40,959 INFO L93 Difference]: Finished difference Result 5228 states and 7477 transitions. [2025-02-07 23:56:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:40,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 248 [2025-02-07 23:56:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:40,962 INFO L225 Difference]: With dead ends: 5228 [2025-02-07 23:56:40,962 INFO L226 Difference]: Without dead ends: 3251 [2025-02-07 23:56:40,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:40,965 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 1759 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:40,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 4126 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2025-02-07 23:56:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3251. [2025-02-07 23:56:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 3225 states have (on average 1.4124031007751938) internal successors, (4555), 3225 states have internal predecessors, (4555), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4603 transitions. [2025-02-07 23:56:40,986 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4603 transitions. Word has length 248 [2025-02-07 23:56:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:40,986 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 4603 transitions. [2025-02-07 23:56:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4603 transitions. [2025-02-07 23:56:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-07 23:56:40,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:40,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 23:56:40,989 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -511594538, now seen corresponding path program 1 times [2025-02-07 23:56:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156495535] [2025-02-07 23:56:40,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:41,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-07 23:56:41,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-07 23:56:41,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:41,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156495535] [2025-02-07 23:56:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156495535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:41,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:41,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883302366] [2025-02-07 23:56:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:41,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:41,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:41,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:41,602 INFO L87 Difference]: Start difference. First operand 3251 states and 4603 transitions. Second operand has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:42,414 INFO L93 Difference]: Finished difference Result 5714 states and 8178 transitions. [2025-02-07 23:56:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 249 [2025-02-07 23:56:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:42,418 INFO L225 Difference]: With dead ends: 5714 [2025-02-07 23:56:42,418 INFO L226 Difference]: Without dead ends: 4047 [2025-02-07 23:56:42,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:42,420 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 2458 mSDsluCounter, 5569 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 6370 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:42,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 6370 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2025-02-07 23:56:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3263. [2025-02-07 23:56:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3263 states, 3237 states have (on average 1.4121099783750386) internal successors, (4571), 3237 states have internal predecessors, (4571), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 4619 transitions. [2025-02-07 23:56:42,445 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 4619 transitions. Word has length 249 [2025-02-07 23:56:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:42,445 INFO L471 AbstractCegarLoop]: Abstraction has 3263 states and 4619 transitions. [2025-02-07 23:56:42,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 4619 transitions. [2025-02-07 23:56:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-07 23:56:42,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:42,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:42,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 23:56:42,447 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:42,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash -375700955, now seen corresponding path program 1 times [2025-02-07 23:56:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:42,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848138641] [2025-02-07 23:56:42,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:42,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-07 23:56:42,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-07 23:56:42,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848138641] [2025-02-07 23:56:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848138641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73001510] [2025-02-07 23:56:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:42,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:42,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:42,779 INFO L87 Difference]: Start difference. First operand 3263 states and 4619 transitions. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:43,254 INFO L93 Difference]: Finished difference Result 5697 states and 8148 transitions. [2025-02-07 23:56:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:56:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250 [2025-02-07 23:56:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:43,258 INFO L225 Difference]: With dead ends: 5697 [2025-02-07 23:56:43,258 INFO L226 Difference]: Without dead ends: 4039 [2025-02-07 23:56:43,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:56:43,260 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 812 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 4048 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:43,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 4048 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2025-02-07 23:56:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 3291. [2025-02-07 23:56:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3265 states have (on average 1.4110260336906586) internal successors, (4607), 3265 states have internal predecessors, (4607), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4655 transitions. [2025-02-07 23:56:43,285 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4655 transitions. Word has length 250 [2025-02-07 23:56:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:43,286 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 4655 transitions. [2025-02-07 23:56:43,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4655 transitions. [2025-02-07 23:56:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-07 23:56:43,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:43,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 23:56:43,288 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash -838914101, now seen corresponding path program 1 times [2025-02-07 23:56:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183753795] [2025-02-07 23:56:43,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:43,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-07 23:56:43,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-07 23:56:43,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:43,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183753795] [2025-02-07 23:56:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183753795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124647738] [2025-02-07 23:56:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:44,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:44,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:44,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:44,066 INFO L87 Difference]: Start difference. First operand 3291 states and 4655 transitions. Second operand has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:44,767 INFO L93 Difference]: Finished difference Result 5230 states and 7450 transitions. [2025-02-07 23:56:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 250 [2025-02-07 23:56:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:44,771 INFO L225 Difference]: With dead ends: 5230 [2025-02-07 23:56:44,771 INFO L226 Difference]: Without dead ends: 3291 [2025-02-07 23:56:44,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:44,774 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 1752 mSDsluCounter, 4016 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:44,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 4781 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2025-02-07 23:56:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3291. [2025-02-07 23:56:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3265 states have (on average 1.4085758039816232) internal successors, (4599), 3265 states have internal predecessors, (4599), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4647 transitions. [2025-02-07 23:56:44,811 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4647 transitions. Word has length 250 [2025-02-07 23:56:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 4647 transitions. [2025-02-07 23:56:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4647 transitions. [2025-02-07 23:56:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 23:56:44,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:44,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:44,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 23:56:44,815 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:44,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash 609467579, now seen corresponding path program 1 times [2025-02-07 23:56:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530329430] [2025-02-07 23:56:44,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:44,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:44,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 23:56:44,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 23:56:44,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:44,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530329430] [2025-02-07 23:56:45,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530329430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:45,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:45,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:56:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238637943] [2025-02-07 23:56:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:45,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:56:45,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:45,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:56:45,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:45,060 INFO L87 Difference]: Start difference. First operand 3291 states and 4647 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:45,370 INFO L93 Difference]: Finished difference Result 5222 states and 7424 transitions. [2025-02-07 23:56:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:56:45,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2025-02-07 23:56:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:45,373 INFO L225 Difference]: With dead ends: 5222 [2025-02-07 23:56:45,373 INFO L226 Difference]: Without dead ends: 3331 [2025-02-07 23:56:45,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:45,379 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 2 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:45,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3253 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:56:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2025-02-07 23:56:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3323. [2025-02-07 23:56:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 3297 states have (on average 1.4070367000303305) internal successors, (4639), 3297 states have internal predecessors, (4639), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4687 transitions. [2025-02-07 23:56:45,411 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4687 transitions. Word has length 251 [2025-02-07 23:56:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 3323 states and 4687 transitions. [2025-02-07 23:56:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4687 transitions. [2025-02-07 23:56:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 23:56:45,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:45,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:45,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 23:56:45,414 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:45,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash 730797808, now seen corresponding path program 1 times [2025-02-07 23:56:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:45,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257380855] [2025-02-07 23:56:45,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:45,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 23:56:45,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 23:56:45,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:45,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257380855] [2025-02-07 23:56:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257380855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:56:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500691198] [2025-02-07 23:56:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:45,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:56:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:45,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:56:45,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:45,725 INFO L87 Difference]: Start difference. First operand 3323 states and 4687 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:45,965 INFO L93 Difference]: Finished difference Result 5357 states and 7601 transitions. [2025-02-07 23:56:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:56:45,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2025-02-07 23:56:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:45,969 INFO L225 Difference]: With dead ends: 5357 [2025-02-07 23:56:45,969 INFO L226 Difference]: Without dead ends: 3359 [2025-02-07 23:56:45,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:56:45,972 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 0 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:45,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2448 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:56:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2025-02-07 23:56:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3359. [2025-02-07 23:56:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3333 states have (on average 1.4026402640264026) internal successors, (4675), 3333 states have internal predecessors, (4675), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4723 transitions. [2025-02-07 23:56:46,007 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4723 transitions. Word has length 251 [2025-02-07 23:56:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 4723 transitions. [2025-02-07 23:56:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4723 transitions. [2025-02-07 23:56:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 23:56:46,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:46,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:46,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 23:56:46,011 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1240290549, now seen corresponding path program 1 times [2025-02-07 23:56:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247798892] [2025-02-07 23:56:46,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 23:56:46,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 23:56:46,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:46,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247798892] [2025-02-07 23:56:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247798892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932737654] [2025-02-07 23:56:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:46,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:46,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:46,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:46,710 INFO L87 Difference]: Start difference. First operand 3359 states and 4723 transitions. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:47,293 INFO L93 Difference]: Finished difference Result 4877 states and 6919 transitions. [2025-02-07 23:56:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:47,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2025-02-07 23:56:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:47,298 INFO L225 Difference]: With dead ends: 4877 [2025-02-07 23:56:47,298 INFO L226 Difference]: Without dead ends: 3421 [2025-02-07 23:56:47,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:47,300 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1354 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:47,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 3710 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-02-07 23:56:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3375. [2025-02-07 23:56:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3375 states, 3349 states have (on average 1.40250821140639) internal successors, (4697), 3349 states have internal predecessors, (4697), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4745 transitions. [2025-02-07 23:56:47,328 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4745 transitions. Word has length 251 [2025-02-07 23:56:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:47,328 INFO L471 AbstractCegarLoop]: Abstraction has 3375 states and 4745 transitions. [2025-02-07 23:56:47,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4745 transitions. [2025-02-07 23:56:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-07 23:56:47,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:47,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 23:56:47,333 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:47,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1863993130, now seen corresponding path program 1 times [2025-02-07 23:56:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36897901] [2025-02-07 23:56:47,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:47,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-07 23:56:47,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-07 23:56:47,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:47,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36897901] [2025-02-07 23:56:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36897901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:56:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118417165] [2025-02-07 23:56:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:56:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:56:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:56:48,134 INFO L87 Difference]: Start difference. First operand 3375 states and 4745 transitions. Second operand has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 12 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:49,100 INFO L93 Difference]: Finished difference Result 5363 states and 7603 transitions. [2025-02-07 23:56:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:56:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 12 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 252 [2025-02-07 23:56:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:49,104 INFO L225 Difference]: With dead ends: 5363 [2025-02-07 23:56:49,104 INFO L226 Difference]: Without dead ends: 3415 [2025-02-07 23:56:49,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:56:49,106 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1768 mSDsluCounter, 4821 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 5577 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:49,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 5577 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:56:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2025-02-07 23:56:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3391. [2025-02-07 23:56:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3365 states have (on average 1.400594353640416) internal successors, (4713), 3365 states have internal predecessors, (4713), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4761 transitions. [2025-02-07 23:56:49,137 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4761 transitions. Word has length 252 [2025-02-07 23:56:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 4761 transitions. [2025-02-07 23:56:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 12 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4761 transitions. [2025-02-07 23:56:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-07 23:56:49,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:49,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 23:56:49,144 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:49,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1374421514, now seen corresponding path program 1 times [2025-02-07 23:56:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798866853] [2025-02-07 23:56:49,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-07 23:56:49,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-07 23:56:49,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:49,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798866853] [2025-02-07 23:56:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798866853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:49,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447668514] [2025-02-07 23:56:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:49,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:49,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:49,937 INFO L87 Difference]: Start difference. First operand 3391 states and 4761 transitions. Second operand has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:50,868 INFO L93 Difference]: Finished difference Result 5849 states and 8312 transitions. [2025-02-07 23:56:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:50,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2025-02-07 23:56:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:50,873 INFO L225 Difference]: With dead ends: 5849 [2025-02-07 23:56:50,873 INFO L226 Difference]: Without dead ends: 4167 [2025-02-07 23:56:50,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:50,876 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 1778 mSDsluCounter, 5552 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 6352 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:50,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 6352 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:56:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2025-02-07 23:56:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 3403. [2025-02-07 23:56:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3377 states have (on average 1.4003553449807522) internal successors, (4729), 3377 states have internal predecessors, (4729), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4777 transitions. [2025-02-07 23:56:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4777 transitions. Word has length 253 [2025-02-07 23:56:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:50,904 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 4777 transitions. [2025-02-07 23:56:50,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4777 transitions. [2025-02-07 23:56:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-07 23:56:50,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:50,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:50,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 23:56:50,906 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:50,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 121438047, now seen corresponding path program 1 times [2025-02-07 23:56:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:50,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263133743] [2025-02-07 23:56:50,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:50,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-07 23:56:51,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-07 23:56:51,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:51,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263133743] [2025-02-07 23:56:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263133743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:51,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728290984] [2025-02-07 23:56:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:51,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:51,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:51,428 INFO L87 Difference]: Start difference. First operand 3403 states and 4777 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:51,991 INFO L93 Difference]: Finished difference Result 5832 states and 8282 transitions. [2025-02-07 23:56:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2025-02-07 23:56:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:51,995 INFO L225 Difference]: With dead ends: 5832 [2025-02-07 23:56:51,996 INFO L226 Difference]: Without dead ends: 4159 [2025-02-07 23:56:51,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:51,998 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 805 mSDsluCounter, 4036 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:51,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 4845 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2025-02-07 23:56:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 3435. [2025-02-07 23:56:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 3409 states have (on average 1.3989439718392491) internal successors, (4769), 3409 states have internal predecessors, (4769), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4817 transitions. [2025-02-07 23:56:52,025 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4817 transitions. Word has length 253 [2025-02-07 23:56:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:52,025 INFO L471 AbstractCegarLoop]: Abstraction has 3435 states and 4817 transitions. [2025-02-07 23:56:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4817 transitions. [2025-02-07 23:56:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-07 23:56:52,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:52,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:52,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 23:56:52,028 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:52,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1614683769, now seen corresponding path program 1 times [2025-02-07 23:56:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:52,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074008936] [2025-02-07 23:56:52,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:52,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:52,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-07 23:56:52,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-07 23:56:52,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:52,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074008936] [2025-02-07 23:56:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074008936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405041930] [2025-02-07 23:56:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:52,673 INFO L87 Difference]: Start difference. First operand 3435 states and 4817 transitions. Second operand has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:53,388 INFO L93 Difference]: Finished difference Result 5374 states and 7597 transitions. [2025-02-07 23:56:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 253 [2025-02-07 23:56:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:53,393 INFO L225 Difference]: With dead ends: 5374 [2025-02-07 23:56:53,393 INFO L226 Difference]: Without dead ends: 3435 [2025-02-07 23:56:53,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:53,396 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1743 mSDsluCounter, 4017 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:53,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 4781 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:56:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-02-07 23:56:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2025-02-07 23:56:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 3409 states have (on average 1.3942505133470227) internal successors, (4753), 3409 states have internal predecessors, (4753), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4801 transitions. [2025-02-07 23:56:53,440 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4801 transitions. Word has length 253 [2025-02-07 23:56:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 3435 states and 4801 transitions. [2025-02-07 23:56:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.6) internal successors, (246), 10 states have internal predecessors, (246), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 23:56:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4801 transitions. [2025-02-07 23:56:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 23:56:53,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:53,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:53,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 23:56:53,444 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:53,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1929115061, now seen corresponding path program 1 times [2025-02-07 23:56:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:53,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494396526] [2025-02-07 23:56:53,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:53,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 23:56:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 23:56:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494396526] [2025-02-07 23:56:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494396526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:56:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763375741] [2025-02-07 23:56:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:56:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:56:54,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:56:54,049 INFO L87 Difference]: Start difference. First operand 3435 states and 4801 transitions. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:54,465 INFO L93 Difference]: Finished difference Result 4926 states and 6949 transitions. [2025-02-07 23:56:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:56:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2025-02-07 23:56:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:54,468 INFO L225 Difference]: With dead ends: 4926 [2025-02-07 23:56:54,468 INFO L226 Difference]: Without dead ends: 3455 [2025-02-07 23:56:54,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:54,470 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 268 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 4019 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:54,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 4019 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:56:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2025-02-07 23:56:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3451. [2025-02-07 23:56:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3425 states have (on average 1.3941605839416058) internal successors, (4775), 3425 states have internal predecessors, (4775), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4823 transitions. [2025-02-07 23:56:54,495 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4823 transitions. Word has length 254 [2025-02-07 23:56:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:54,495 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 4823 transitions. [2025-02-07 23:56:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4823 transitions. [2025-02-07 23:56:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 23:56:54,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:54,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:54,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 23:56:54,498 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash 352651109, now seen corresponding path program 1 times [2025-02-07 23:56:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417306721] [2025-02-07 23:56:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:54,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 23:56:54,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 23:56:54,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:54,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417306721] [2025-02-07 23:56:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417306721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:56:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653677746] [2025-02-07 23:56:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:56:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:54,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:56:54,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:54,786 INFO L87 Difference]: Start difference. First operand 3451 states and 4823 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:55,085 INFO L93 Difference]: Finished difference Result 5922 states and 8263 transitions. [2025-02-07 23:56:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:56:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2025-02-07 23:56:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:55,089 INFO L225 Difference]: With dead ends: 5922 [2025-02-07 23:56:55,089 INFO L226 Difference]: Without dead ends: 3475 [2025-02-07 23:56:55,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:55,091 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 908 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:55,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2430 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:56:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2025-02-07 23:56:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3463. [2025-02-07 23:56:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3437 states have (on average 1.3927844050043643) internal successors, (4787), 3437 states have internal predecessors, (4787), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4835 transitions. [2025-02-07 23:56:55,115 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4835 transitions. Word has length 254 [2025-02-07 23:56:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 4835 transitions. [2025-02-07 23:56:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4835 transitions. [2025-02-07 23:56:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 23:56:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:55,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 23:56:55,118 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1609587168, now seen corresponding path program 1 times [2025-02-07 23:56:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252389536] [2025-02-07 23:56:55,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 23:56:55,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 23:56:55,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:55,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252389536] [2025-02-07 23:56:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252389536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407253884] [2025-02-07 23:56:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:55,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:55,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:55,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:55,739 INFO L87 Difference]: Start difference. First operand 3463 states and 4835 transitions. Second operand has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:56,502 INFO L93 Difference]: Finished difference Result 6047 states and 8528 transitions. [2025-02-07 23:56:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2025-02-07 23:56:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:56,507 INFO L225 Difference]: With dead ends: 6047 [2025-02-07 23:56:56,507 INFO L226 Difference]: Without dead ends: 4211 [2025-02-07 23:56:56,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:56,509 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2381 mSDsluCounter, 4858 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 5658 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:56,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 5658 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2025-02-07 23:56:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3471. [2025-02-07 23:56:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3445 states have (on average 1.3918722786647315) internal successors, (4795), 3445 states have internal predecessors, (4795), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4843 transitions. [2025-02-07 23:56:56,537 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4843 transitions. Word has length 254 [2025-02-07 23:56:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:56,537 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 4843 transitions. [2025-02-07 23:56:56,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4843 transitions. [2025-02-07 23:56:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 23:56:56,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:56,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:56,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 23:56:56,541 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:56,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1590821940, now seen corresponding path program 1 times [2025-02-07 23:56:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:56,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418370395] [2025-02-07 23:56:56,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:56,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 23:56:56,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 23:56:56,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:56,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418370395] [2025-02-07 23:56:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418370395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:56:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553752314] [2025-02-07 23:56:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:56:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:56:57,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:56:57,053 INFO L87 Difference]: Start difference. First operand 3471 states and 4843 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:57,642 INFO L93 Difference]: Finished difference Result 4993 states and 7034 transitions. [2025-02-07 23:56:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:56:57,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2025-02-07 23:56:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:57,647 INFO L225 Difference]: With dead ends: 4993 [2025-02-07 23:56:57,647 INFO L226 Difference]: Without dead ends: 3517 [2025-02-07 23:56:57,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:56:57,649 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1427 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:57,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 3705 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:56:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2025-02-07 23:56:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3487. [2025-02-07 23:56:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3487 states, 3461 states have (on average 1.3917942791100837) internal successors, (4817), 3461 states have internal predecessors, (4817), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 4865 transitions. [2025-02-07 23:56:57,680 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 4865 transitions. Word has length 254 [2025-02-07 23:56:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 3487 states and 4865 transitions. [2025-02-07 23:56:57,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 4865 transitions. [2025-02-07 23:56:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-07 23:56:57,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:57,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 23:56:57,683 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1530874785, now seen corresponding path program 1 times [2025-02-07 23:56:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133875613] [2025-02-07 23:56:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-07 23:56:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-07 23:56:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:58,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:58,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133875613] [2025-02-07 23:56:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133875613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:58,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:56:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801223580] [2025-02-07 23:56:58,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:56:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:58,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:56:58,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:56:58,290 INFO L87 Difference]: Start difference. First operand 3487 states and 4865 transitions. Second operand has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:56:59,122 INFO L93 Difference]: Finished difference Result 6017 states and 8492 transitions. [2025-02-07 23:56:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:56:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2025-02-07 23:56:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:56:59,127 INFO L225 Difference]: With dead ends: 6017 [2025-02-07 23:56:59,127 INFO L226 Difference]: Without dead ends: 4243 [2025-02-07 23:56:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:56:59,129 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 1788 mSDsluCounter, 5563 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 6363 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:56:59,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 6363 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:56:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2025-02-07 23:56:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 3495. [2025-02-07 23:56:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3469 states have (on average 1.3908907466128568) internal successors, (4825), 3469 states have internal predecessors, (4825), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 23:56:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4873 transitions. [2025-02-07 23:56:59,160 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4873 transitions. Word has length 255 [2025-02-07 23:56:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:56:59,160 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 4873 transitions. [2025-02-07 23:56:59,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 23:56:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4873 transitions. [2025-02-07 23:56:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-07 23:56:59,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:56:59,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:56:59,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 23:56:59,162 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:56:59,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:56:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1035329858, now seen corresponding path program 1 times [2025-02-07 23:56:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:56:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144145953] [2025-02-07 23:56:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:56:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:56:59,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-07 23:56:59,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-07 23:56:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:56:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:56:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 23:56:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:56:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144145953] [2025-02-07 23:56:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144145953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:56:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:56:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:56:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855201262] [2025-02-07 23:56:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:56:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:56:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:56:59,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:56:59,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:56:59,449 INFO L87 Difference]: Start difference. First operand 3495 states and 4873 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)