./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 096bd3f2a021fa47b1c02d78a0aae6264c2c575942ed4c9ecbbbcad808039ae8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:56:42,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:56:42,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:56:42,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:56:42,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:56:42,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:56:42,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:56:42,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:56:42,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:56:42,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:56:42,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:56:42,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:56:42,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:56:42,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:56:42,435 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:56:42,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:56:42,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:56:42,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:56:42,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:56:42,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:56:42,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:56:42,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:56:42,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:56:42,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:56:42,438 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 -> 096bd3f2a021fa47b1c02d78a0aae6264c2c575942ed4c9ecbbbcad808039ae8 [2025-02-05 18:56:42,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:56:42,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:56:42,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:56:42,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:56:42,703 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:56:42,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2025-02-05 18:56:43,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e67bbf447/186b1c60229640b69ab7b1071107c4b9/FLAG11d15a5b0 [2025-02-05 18:56:44,113 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:56:44,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2025-02-05 18:56:44,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e67bbf447/186b1c60229640b69ab7b1071107c4b9/FLAG11d15a5b0 [2025-02-05 18:56:44,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e67bbf447/186b1c60229640b69ab7b1071107c4b9 [2025-02-05 18:56:44,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:56:44,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:56:44,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:56:44,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:56:44,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:56:44,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:44,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b60b095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44, skipping insertion in model container [2025-02-05 18:56:44,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:44,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:56:44,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c[1280,1293] [2025-02-05 18:56:44,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:56:44,792 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:56:44,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c[1280,1293] [2025-02-05 18:56:44,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:56:44,910 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:56:44,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44 WrapperNode [2025-02-05 18:56:44,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:56:44,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:56:44,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:56:44,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:56:44,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:44,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,181 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3162 [2025-02-05 18:56:45,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:56:45,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:56:45,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:56:45,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:56:45,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,291 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 18:56:45,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:56:45,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:56:45,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:56:45,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:56:45,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (1/1) ... [2025-02-05 18:56:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:56:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:56:45,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:56:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:56:45,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:56:45,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 18:56:45,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 18:56:45,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:56:45,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:56:45,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:56:45,710 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:56:45,712 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:56:48,298 INFO L? ?]: Removed 1764 outVars from TransFormulas that were not future-live. [2025-02-05 18:56:48,298 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:56:48,425 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:56:48,426 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:56:48,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:56:48 BoogieIcfgContainer [2025-02-05 18:56:48,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:56:48,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:56:48,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:56:48,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:56:48,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:56:44" (1/3) ... [2025-02-05 18:56:48,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:56:48, skipping insertion in model container [2025-02-05 18:56:48,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:56:44" (2/3) ... [2025-02-05 18:56:48,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:56:48, skipping insertion in model container [2025-02-05 18:56:48,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:56:48" (3/3) ... [2025-02-05 18:56:48,433 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2025-02-05 18:56:48,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:56:48,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c that has 2 procedures, 872 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:56:48,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:56:48,523 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;@322010e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:56:48,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:56:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 866 states have (on average 1.4965357967667436) internal successors, (1296), 867 states have internal predecessors, (1296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 18:56:48,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:48,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:48,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash 202660603, now seen corresponding path program 1 times [2025-02-05 18:56:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414498040] [2025-02-05 18:56:48,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:48,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 18:56:48,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 18:56:48,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:48,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 18:56:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414498040] [2025-02-05 18:56:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414498040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:56:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268685464] [2025-02-05 18:56:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:56:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:56:49,041 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-05 18:56:49,042 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-05 18:56:49,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 18:56:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 18:56:49,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:49,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 18:56:49,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:56:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 18:56:49,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:56:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268685464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:56:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 18:56:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525601971] [2025-02-05 18:56:49,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 18:56:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:49,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 18:56:49,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 18:56:49,658 INFO L87 Difference]: Start difference. First operand has 872 states, 866 states have (on average 1.4965357967667436) internal successors, (1296), 867 states have internal predecessors, (1296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:56:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:49,937 INFO L93 Difference]: Finished difference Result 1575 states and 2357 transitions. [2025-02-05 18:56:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 18:56:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 213 [2025-02-05 18:56:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:49,951 INFO L225 Difference]: With dead ends: 1575 [2025-02-05 18:56:49,951 INFO L226 Difference]: Without dead ends: 869 [2025-02-05 18:56:49,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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-05 18:56:49,956 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:49,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1084 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:56:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-02-05 18:56:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-02-05 18:56:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 864 states have (on average 1.494212962962963) internal successors, (1291), 864 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1297 transitions. [2025-02-05 18:56:50,015 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1297 transitions. Word has length 213 [2025-02-05 18:56:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:50,016 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1297 transitions. [2025-02-05 18:56:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:56:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1297 transitions. [2025-02-05 18:56:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 18:56:50,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:50,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:50,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 18:56:50,224 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-05 18:56:50,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1464785256, now seen corresponding path program 1 times [2025-02-05 18:56:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43765719] [2025-02-05 18:56:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:50,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 18:56:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 18:56:50,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43765719] [2025-02-05 18:56:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43765719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:56:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514619752] [2025-02-05 18:56:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:51,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:56:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:51,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:56:51,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:56:51,378 INFO L87 Difference]: Start difference. First operand 869 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:51,767 INFO L93 Difference]: Finished difference Result 873 states and 1301 transitions. [2025-02-05 18:56:51,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:51,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 213 [2025-02-05 18:56:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:51,771 INFO L225 Difference]: With dead ends: 873 [2025-02-05 18:56:51,771 INFO L226 Difference]: Without dead ends: 871 [2025-02-05 18:56:51,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:56:51,772 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 0 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:51,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3241 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-02-05 18:56:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2025-02-05 18:56:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4930715935334873) internal successors, (1293), 866 states have internal predecessors, (1293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1299 transitions. [2025-02-05 18:56:51,799 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1299 transitions. Word has length 213 [2025-02-05 18:56:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:51,801 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1299 transitions. [2025-02-05 18:56:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1299 transitions. [2025-02-05 18:56:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 18:56:51,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:51,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:51,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:56:51,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1840977291, now seen corresponding path program 1 times [2025-02-05 18:56:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046886573] [2025-02-05 18:56:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 18:56:51,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 18:56:51,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:52,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:52,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046886573] [2025-02-05 18:56:52,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046886573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:52,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104524026] [2025-02-05 18:56:52,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:52,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:52,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:52,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:52,356 INFO L87 Difference]: Start difference. First operand 871 states and 1299 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:53,236 INFO L93 Difference]: Finished difference Result 2171 states and 3241 transitions. [2025-02-05 18:56:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:56:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 214 [2025-02-05 18:56:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:53,241 INFO L225 Difference]: With dead ends: 2171 [2025-02-05 18:56:53,241 INFO L226 Difference]: Without dead ends: 871 [2025-02-05 18:56:53,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:56:53,244 INFO L435 NwaCegarLoop]: 1101 mSDtfsCounter, 2674 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:53,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3072 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:56:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-02-05 18:56:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2025-02-05 18:56:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.491916859122402) internal successors, (1292), 866 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1298 transitions. [2025-02-05 18:56:53,263 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1298 transitions. Word has length 214 [2025-02-05 18:56:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:53,264 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1298 transitions. [2025-02-05 18:56:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1298 transitions. [2025-02-05 18:56:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 18:56:53,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:53,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:53,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:56:53,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 925310350, now seen corresponding path program 1 times [2025-02-05 18:56:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301086993] [2025-02-05 18:56:53,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:53,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:56:53,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:56:53,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:53,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:53,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301086993] [2025-02-05 18:56:53,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301086993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:53,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:53,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:56:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270595125] [2025-02-05 18:56:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:53,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:56:53,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:53,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:56:53,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:56:53,696 INFO L87 Difference]: Start difference. First operand 871 states and 1298 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:54,024 INFO L93 Difference]: Finished difference Result 1578 states and 2351 transitions. [2025-02-05 18:56:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 215 [2025-02-05 18:56:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:54,027 INFO L225 Difference]: With dead ends: 1578 [2025-02-05 18:56:54,027 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:54,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:56:54,028 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 0 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:54,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3235 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:56:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4907834101382489) internal successors, (1294), 868 states have internal predecessors, (1294), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1300 transitions. [2025-02-05 18:56:54,043 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1300 transitions. Word has length 215 [2025-02-05 18:56:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:54,044 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1300 transitions. [2025-02-05 18:56:54,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1300 transitions. [2025-02-05 18:56:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 18:56:54,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:54,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:54,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:56:54,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 551359824, now seen corresponding path program 1 times [2025-02-05 18:56:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121414674] [2025-02-05 18:56:54,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 18:56:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 18:56:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121414674] [2025-02-05 18:56:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121414674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:56:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868237549] [2025-02-05 18:56:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:56:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:54,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:56:54,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:56:54,633 INFO L87 Difference]: Start difference. First operand 873 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:55,029 INFO L93 Difference]: Finished difference Result 1580 states and 2352 transitions. [2025-02-05 18:56:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2025-02-05 18:56:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:55,033 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:55,033 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:55,034 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-05 18:56:55,035 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 1139 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:55,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 2036 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4884792626728112) internal successors, (1292), 868 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2025-02-05 18:56:55,051 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 216 [2025-02-05 18:56:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:55,052 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2025-02-05 18:56:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2025-02-05 18:56:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 18:56:55,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:55,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:55,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:56:55,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1152719594, now seen corresponding path program 1 times [2025-02-05 18:56:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632894413] [2025-02-05 18:56:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:55,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 18:56:55,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 18:56:55,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:55,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:55,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632894413] [2025-02-05 18:56:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632894413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:55,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277498887] [2025-02-05 18:56:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:55,400 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:55,835 INFO L93 Difference]: Finished difference Result 1588 states and 2359 transitions. [2025-02-05 18:56:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:56:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 218 [2025-02-05 18:56:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:55,839 INFO L225 Difference]: With dead ends: 1588 [2025-02-05 18:56:55,839 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:55,840 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-05 18:56:55,841 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 1154 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:55,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3165 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.487327188940092) internal successors, (1291), 868 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1297 transitions. [2025-02-05 18:56:55,858 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1297 transitions. Word has length 218 [2025-02-05 18:56:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:55,858 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1297 transitions. [2025-02-05 18:56:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1297 transitions. [2025-02-05 18:56:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 18:56:55,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:55,861 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:55,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:56:55,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -762103574, now seen corresponding path program 1 times [2025-02-05 18:56:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828514657] [2025-02-05 18:56:55,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:55,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 18:56:55,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 18:56:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828514657] [2025-02-05 18:56:56,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828514657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:56,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521644039] [2025-02-05 18:56:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:56,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:56,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:56,253 INFO L87 Difference]: Start difference. First operand 873 states and 1297 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:56,686 INFO L93 Difference]: Finished difference Result 1580 states and 2346 transitions. [2025-02-05 18:56:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:56,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 219 [2025-02-05 18:56:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:56,689 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:56,689 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:56,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:56:56,692 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 2421 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:56,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 2036 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4861751152073732) internal successors, (1290), 868 states have internal predecessors, (1290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1296 transitions. [2025-02-05 18:56:56,712 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1296 transitions. Word has length 219 [2025-02-05 18:56:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1296 transitions. [2025-02-05 18:56:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1296 transitions. [2025-02-05 18:56:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 18:56:56,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:56,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:56:56,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1639747909, now seen corresponding path program 1 times [2025-02-05 18:56:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794155081] [2025-02-05 18:56:56,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:56,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 18:56:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 18:56:56,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794155081] [2025-02-05 18:56:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794155081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:57,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150256707] [2025-02-05 18:56:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:57,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:57,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:57,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:57,090 INFO L87 Difference]: Start difference. First operand 873 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:57,491 INFO L93 Difference]: Finished difference Result 1580 states and 2344 transitions. [2025-02-05 18:56:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 220 [2025-02-05 18:56:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:57,494 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:57,494 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:57,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:56:57,497 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 2413 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:57,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 2036 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4850230414746544) internal successors, (1289), 868 states have internal predecessors, (1289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1295 transitions. [2025-02-05 18:56:57,513 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1295 transitions. Word has length 220 [2025-02-05 18:56:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:57,514 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1295 transitions. [2025-02-05 18:56:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1295 transitions. [2025-02-05 18:56:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 18:56:57,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:57,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:57,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:56:57,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2086546075, now seen corresponding path program 1 times [2025-02-05 18:56:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806211392] [2025-02-05 18:56:57,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:57,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 18:56:57,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 18:56:57,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:57,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:57,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806211392] [2025-02-05 18:56:57,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806211392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:57,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72009565] [2025-02-05 18:56:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:57,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:57,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:57,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:57,845 INFO L87 Difference]: Start difference. First operand 873 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:58,261 INFO L93 Difference]: Finished difference Result 1580 states and 2342 transitions. [2025-02-05 18:56:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 221 [2025-02-05 18:56:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:58,264 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:58,264 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:58,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:56:58,268 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 1273 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:58,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 2043 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4838709677419355) internal successors, (1288), 868 states have internal predecessors, (1288), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1294 transitions. [2025-02-05 18:56:58,284 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1294 transitions. Word has length 221 [2025-02-05 18:56:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1294 transitions. [2025-02-05 18:56:58,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1294 transitions. [2025-02-05 18:56:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 18:56:58,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:58,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:58,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:56:58,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 211824928, now seen corresponding path program 1 times [2025-02-05 18:56:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59352254] [2025-02-05 18:56:58,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:58,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 18:56:58,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 18:56:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59352254] [2025-02-05 18:56:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59352254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:58,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646534275] [2025-02-05 18:56:58,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:58,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:58,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:58,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:58,596 INFO L87 Difference]: Start difference. First operand 873 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:58,986 INFO L93 Difference]: Finished difference Result 1580 states and 2340 transitions. [2025-02-05 18:56:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 222 [2025-02-05 18:56:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:58,989 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:58,989 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:58,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:56:58,990 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 2389 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 2036 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:56:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4827188940092166) internal successors, (1287), 868 states have internal predecessors, (1287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1293 transitions. [2025-02-05 18:56:59,005 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1293 transitions. Word has length 222 [2025-02-05 18:56:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:59,006 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1293 transitions. [2025-02-05 18:56:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1293 transitions. [2025-02-05 18:56:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 18:56:59,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:59,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:59,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:56:59,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:59,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1391014535, now seen corresponding path program 1 times [2025-02-05 18:56:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627930805] [2025-02-05 18:56:59,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:59,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 18:56:59,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 18:56:59,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:59,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:56:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:56:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:56:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627930805] [2025-02-05 18:56:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627930805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:56:59,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:56:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:56:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027658848] [2025-02-05 18:56:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:56:59,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:56:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:56:59,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:56:59,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:56:59,316 INFO L87 Difference]: Start difference. First operand 873 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:56:59,698 INFO L93 Difference]: Finished difference Result 1580 states and 2338 transitions. [2025-02-05 18:56:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:56:59,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 223 [2025-02-05 18:56:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:56:59,701 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:56:59,701 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:56:59,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:56:59,703 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 2381 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:56:59,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 2036 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:56:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:56:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:56:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4815668202764978) internal successors, (1286), 868 states have internal predecessors, (1286), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:56:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1292 transitions. [2025-02-05 18:56:59,716 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1292 transitions. Word has length 223 [2025-02-05 18:56:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:56:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1292 transitions. [2025-02-05 18:56:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:56:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1292 transitions. [2025-02-05 18:56:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 18:56:59,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:56:59,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:56:59,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:56:59,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:56:59,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:56:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash -621378341, now seen corresponding path program 1 times [2025-02-05 18:56:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:56:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005328458] [2025-02-05 18:56:59,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:56:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:56:59,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 18:56:59,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 18:56:59,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:56:59,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005328458] [2025-02-05 18:57:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005328458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:00,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255583448] [2025-02-05 18:57:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:00,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:00,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:00,065 INFO L87 Difference]: Start difference. First operand 873 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:00,444 INFO L93 Difference]: Finished difference Result 1580 states and 2336 transitions. [2025-02-05 18:57:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 224 [2025-02-05 18:57:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:00,448 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:00,448 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:00,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:00,449 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 2373 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:00,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 2036 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4804147465437787) internal successors, (1285), 868 states have internal predecessors, (1285), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1291 transitions. [2025-02-05 18:57:00,463 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1291 transitions. Word has length 224 [2025-02-05 18:57:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:00,463 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1291 transitions. [2025-02-05 18:57:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1291 transitions. [2025-02-05 18:57:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 18:57:00,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:00,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:57:00,466 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 659267234, now seen corresponding path program 1 times [2025-02-05 18:57:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301028290] [2025-02-05 18:57:00,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 18:57:00,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 18:57:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:00,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:00,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301028290] [2025-02-05 18:57:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301028290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:00,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:00,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:00,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190185142] [2025-02-05 18:57:00,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:00,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:00,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:00,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:00,844 INFO L87 Difference]: Start difference. First operand 873 states and 1291 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:01,189 INFO L93 Difference]: Finished difference Result 1580 states and 2334 transitions. [2025-02-05 18:57:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 225 [2025-02-05 18:57:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:01,192 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:01,192 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:01,193 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-05 18:57:01,193 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1145 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2082 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:01,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2082 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4792626728110598) internal successors, (1284), 868 states have internal predecessors, (1284), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1290 transitions. [2025-02-05 18:57:01,208 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1290 transitions. Word has length 225 [2025-02-05 18:57:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1290 transitions. [2025-02-05 18:57:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1290 transitions. [2025-02-05 18:57:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 18:57:01,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:01,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:01,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:57:01,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1762887597, now seen corresponding path program 1 times [2025-02-05 18:57:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652451153] [2025-02-05 18:57:01,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:01,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 18:57:01,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 18:57:01,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:01,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652451153] [2025-02-05 18:57:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652451153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424797336] [2025-02-05 18:57:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:01,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:01,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:01,498 INFO L87 Difference]: Start difference. First operand 873 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:01,892 INFO L93 Difference]: Finished difference Result 1582 states and 2334 transitions. [2025-02-05 18:57:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:57:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 226 [2025-02-05 18:57:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:01,895 INFO L225 Difference]: With dead ends: 1582 [2025-02-05 18:57:01,895 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:01,896 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-05 18:57:01,897 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 1148 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:01,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 3178 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.478110599078341) internal successors, (1283), 868 states have internal predecessors, (1283), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1289 transitions. [2025-02-05 18:57:01,910 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1289 transitions. Word has length 226 [2025-02-05 18:57:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:01,911 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1289 transitions. [2025-02-05 18:57:01,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1289 transitions. [2025-02-05 18:57:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 18:57:01,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:01,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:57:01,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:01,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 804074599, now seen corresponding path program 1 times [2025-02-05 18:57:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281021130] [2025-02-05 18:57:01,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 18:57:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 18:57:01,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281021130] [2025-02-05 18:57:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281021130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380824421] [2025-02-05 18:57:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:02,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:02,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:02,178 INFO L87 Difference]: Start difference. First operand 873 states and 1289 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:02,524 INFO L93 Difference]: Finished difference Result 1580 states and 2330 transitions. [2025-02-05 18:57:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 227 [2025-02-05 18:57:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:02,527 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:02,527 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:02,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:02,530 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 2407 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:02,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 2082 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.476958525345622) internal successors, (1282), 868 states have internal predecessors, (1282), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1288 transitions. [2025-02-05 18:57:02,543 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1288 transitions. Word has length 227 [2025-02-05 18:57:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:02,544 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1288 transitions. [2025-02-05 18:57:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1288 transitions. [2025-02-05 18:57:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 18:57:02,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:02,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:02,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:57:02,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1656205133, now seen corresponding path program 1 times [2025-02-05 18:57:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400330636] [2025-02-05 18:57:02,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 18:57:02,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 18:57:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400330636] [2025-02-05 18:57:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400330636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:02,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682304627] [2025-02-05 18:57:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:02,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:02,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:02,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:02,881 INFO L87 Difference]: Start difference. First operand 873 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:03,255 INFO L93 Difference]: Finished difference Result 1580 states and 2328 transitions. [2025-02-05 18:57:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 228 [2025-02-05 18:57:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:03,258 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:03,258 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:03,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:03,260 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 2399 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:03,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 2082 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4758064516129032) internal successors, (1281), 868 states have internal predecessors, (1281), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1287 transitions. [2025-02-05 18:57:03,278 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1287 transitions. Word has length 228 [2025-02-05 18:57:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1287 transitions. [2025-02-05 18:57:03,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1287 transitions. [2025-02-05 18:57:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 18:57:03,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:03,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:03,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:57:03,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 702877868, now seen corresponding path program 1 times [2025-02-05 18:57:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647158953] [2025-02-05 18:57:03,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:03,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 18:57:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 18:57:03,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:03,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647158953] [2025-02-05 18:57:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647158953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327242456] [2025-02-05 18:57:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:03,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:03,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:03,744 INFO L87 Difference]: Start difference. First operand 873 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:04,204 INFO L93 Difference]: Finished difference Result 1580 states and 2326 transitions. [2025-02-05 18:57:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:04,205 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 229 [2025-02-05 18:57:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:04,207 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:04,207 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:04,208 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-05 18:57:04,209 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1090 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:04,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1882 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4746543778801844) internal successors, (1280), 868 states have internal predecessors, (1280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1286 transitions. [2025-02-05 18:57:04,222 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1286 transitions. Word has length 229 [2025-02-05 18:57:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1286 transitions. [2025-02-05 18:57:04,222 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1286 transitions. [2025-02-05 18:57:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 18:57:04,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:04,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:57:04,223 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1312473308, now seen corresponding path program 1 times [2025-02-05 18:57:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391908166] [2025-02-05 18:57:04,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:04,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 18:57:04,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 18:57:04,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:04,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391908166] [2025-02-05 18:57:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391908166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120447111] [2025-02-05 18:57:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:04,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:04,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:04,479 INFO L87 Difference]: Start difference. First operand 873 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:04,976 INFO L93 Difference]: Finished difference Result 1596 states and 2347 transitions. [2025-02-05 18:57:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:57:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 230 [2025-02-05 18:57:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:04,979 INFO L225 Difference]: With dead ends: 1596 [2025-02-05 18:57:04,979 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:04,979 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-05 18:57:04,980 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 1121 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:04,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3056 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:57:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4735023041474655) internal successors, (1279), 868 states have internal predecessors, (1279), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1285 transitions. [2025-02-05 18:57:04,990 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1285 transitions. Word has length 230 [2025-02-05 18:57:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1285 transitions. [2025-02-05 18:57:04,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1285 transitions. [2025-02-05 18:57:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 18:57:04,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:04,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:57:04,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2081748348, now seen corresponding path program 1 times [2025-02-05 18:57:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081700620] [2025-02-05 18:57:04,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 18:57:05,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 18:57:05,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:05,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081700620] [2025-02-05 18:57:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081700620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445680238] [2025-02-05 18:57:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:05,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:05,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:05,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:05,266 INFO L87 Difference]: Start difference. First operand 873 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:05,711 INFO L93 Difference]: Finished difference Result 1580 states and 2322 transitions. [2025-02-05 18:57:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2025-02-05 18:57:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:05,714 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:05,715 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:05,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:05,716 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2368 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:05,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 1882 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4723502304147464) internal successors, (1278), 868 states have internal predecessors, (1278), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1284 transitions. [2025-02-05 18:57:05,726 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1284 transitions. Word has length 231 [2025-02-05 18:57:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:05,726 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1284 transitions. [2025-02-05 18:57:05,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1284 transitions. [2025-02-05 18:57:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 18:57:05,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:05,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:05,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:57:05,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:05,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1144809321, now seen corresponding path program 1 times [2025-02-05 18:57:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811765236] [2025-02-05 18:57:05,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:05,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 18:57:05,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 18:57:05,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:05,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811765236] [2025-02-05 18:57:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811765236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402233258] [2025-02-05 18:57:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:05,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:05,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:05,994 INFO L87 Difference]: Start difference. First operand 873 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:06,387 INFO L93 Difference]: Finished difference Result 1580 states and 2320 transitions. [2025-02-05 18:57:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 232 [2025-02-05 18:57:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:06,389 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:06,390 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:06,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:06,391 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2360 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:06,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 1882 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4711981566820276) internal successors, (1277), 868 states have internal predecessors, (1277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1283 transitions. [2025-02-05 18:57:06,407 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1283 transitions. Word has length 232 [2025-02-05 18:57:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:06,407 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1283 transitions. [2025-02-05 18:57:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1283 transitions. [2025-02-05 18:57:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 18:57:06,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:06,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 18:57:06,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2050011305, now seen corresponding path program 1 times [2025-02-05 18:57:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518087673] [2025-02-05 18:57:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:06,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 18:57:06,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 18:57:06,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:06,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518087673] [2025-02-05 18:57:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518087673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:06,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302329801] [2025-02-05 18:57:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:06,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:06,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:06,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:06,748 INFO L87 Difference]: Start difference. First operand 873 states and 1283 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:07,171 INFO L93 Difference]: Finished difference Result 1580 states and 2318 transitions. [2025-02-05 18:57:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 233 [2025-02-05 18:57:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:07,174 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:07,174 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:07,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:07,175 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1261 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:07,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1889 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4700460829493087) internal successors, (1276), 868 states have internal predecessors, (1276), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1282 transitions. [2025-02-05 18:57:07,186 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1282 transitions. Word has length 233 [2025-02-05 18:57:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:07,187 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1282 transitions. [2025-02-05 18:57:07,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1282 transitions. [2025-02-05 18:57:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 18:57:07,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:07,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:07,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 18:57:07,189 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash 913192494, now seen corresponding path program 1 times [2025-02-05 18:57:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384822406] [2025-02-05 18:57:07,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 18:57:07,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 18:57:07,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:07,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:07,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384822406] [2025-02-05 18:57:07,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384822406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400830318] [2025-02-05 18:57:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:07,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:07,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:07,483 INFO L87 Difference]: Start difference. First operand 873 states and 1282 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:07,898 INFO L93 Difference]: Finished difference Result 1580 states and 2316 transitions. [2025-02-05 18:57:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:07,900 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2025-02-05 18:57:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:07,902 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:07,902 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:07,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:07,904 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2344 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:07,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 1882 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4688940092165899) internal successors, (1275), 868 states have internal predecessors, (1275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1281 transitions. [2025-02-05 18:57:07,913 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1281 transitions. Word has length 234 [2025-02-05 18:57:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1281 transitions. [2025-02-05 18:57:07,914 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1281 transitions. [2025-02-05 18:57:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 18:57:07,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:07,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:07,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 18:57:07,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:07,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1855911246, now seen corresponding path program 1 times [2025-02-05 18:57:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:07,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298809843] [2025-02-05 18:57:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 18:57:07,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 18:57:07,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298809843] [2025-02-05 18:57:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298809843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860349486] [2025-02-05 18:57:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:08,180 INFO L87 Difference]: Start difference. First operand 873 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:08,568 INFO L93 Difference]: Finished difference Result 1580 states and 2314 transitions. [2025-02-05 18:57:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 235 [2025-02-05 18:57:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:08,570 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:08,570 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:08,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:08,571 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2336 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:08,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 1882 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.467741935483871) internal successors, (1274), 868 states have internal predecessors, (1274), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1280 transitions. [2025-02-05 18:57:08,588 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1280 transitions. Word has length 235 [2025-02-05 18:57:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:08,588 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1280 transitions. [2025-02-05 18:57:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1280 transitions. [2025-02-05 18:57:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-05 18:57:08,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:08,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:08,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:57:08,589 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:08,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 556985203, now seen corresponding path program 1 times [2025-02-05 18:57:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561610361] [2025-02-05 18:57:08,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:08,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-05 18:57:08,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-05 18:57:08,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:08,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:08,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:08,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561610361] [2025-02-05 18:57:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561610361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:08,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:08,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474470703] [2025-02-05 18:57:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:08,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:08,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:08,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:08,885 INFO L87 Difference]: Start difference. First operand 873 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:09,252 INFO L93 Difference]: Finished difference Result 1580 states and 2312 transitions. [2025-02-05 18:57:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 236 [2025-02-05 18:57:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:09,254 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:09,255 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:09,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:09,256 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2328 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:09,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 1882 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4665898617511521) internal successors, (1273), 868 states have internal predecessors, (1273), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1279 transitions. [2025-02-05 18:57:09,264 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1279 transitions. Word has length 236 [2025-02-05 18:57:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:09,265 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1279 transitions. [2025-02-05 18:57:09,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1279 transitions. [2025-02-05 18:57:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-05 18:57:09,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:09,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:57:09,266 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:09,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash -286779277, now seen corresponding path program 1 times [2025-02-05 18:57:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513929949] [2025-02-05 18:57:09,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:09,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-05 18:57:09,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-05 18:57:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513929949] [2025-02-05 18:57:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513929949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209476487] [2025-02-05 18:57:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:09,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:09,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:09,526 INFO L87 Difference]: Start difference. First operand 873 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:09,908 INFO L93 Difference]: Finished difference Result 1580 states and 2310 transitions. [2025-02-05 18:57:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 237 [2025-02-05 18:57:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:09,910 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:09,910 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:09,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:09,915 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1245 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:09,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1889 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4654377880184333) internal successors, (1272), 868 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1278 transitions. [2025-02-05 18:57:09,924 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1278 transitions. Word has length 237 [2025-02-05 18:57:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1278 transitions. [2025-02-05 18:57:09,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1278 transitions. [2025-02-05 18:57:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 18:57:09,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:09,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:09,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:57:09,926 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 927123256, now seen corresponding path program 1 times [2025-02-05 18:57:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954956266] [2025-02-05 18:57:09,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:09,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 18:57:10,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 18:57:10,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954956266] [2025-02-05 18:57:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954956266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574692871] [2025-02-05 18:57:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:10,265 INFO L87 Difference]: Start difference. First operand 873 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:10,840 INFO L93 Difference]: Finished difference Result 1580 states and 2308 transitions. [2025-02-05 18:57:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2025-02-05 18:57:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:10,844 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:10,844 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:10,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:10,845 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1238 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:10,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1889 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:57:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4642857142857142) internal successors, (1271), 868 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1277 transitions. [2025-02-05 18:57:10,860 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1277 transitions. Word has length 238 [2025-02-05 18:57:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:10,860 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1277 transitions. [2025-02-05 18:57:10,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1277 transitions. [2025-02-05 18:57:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 18:57:10,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:10,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:10,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 18:57:10,864 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:10,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1752504115, now seen corresponding path program 1 times [2025-02-05 18:57:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:10,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355487226] [2025-02-05 18:57:10,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:10,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 18:57:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 18:57:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:11,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355487226] [2025-02-05 18:57:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355487226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342983984] [2025-02-05 18:57:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:11,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:11,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:11,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:11,219 INFO L87 Difference]: Start difference. First operand 873 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:11,547 INFO L93 Difference]: Finished difference Result 1580 states and 2306 transitions. [2025-02-05 18:57:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:11,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 239 [2025-02-05 18:57:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:11,550 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:11,550 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:11,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:11,551 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1234 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:11,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1889 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4631336405529953) internal successors, (1270), 868 states have internal predecessors, (1270), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1276 transitions. [2025-02-05 18:57:11,559 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1276 transitions. Word has length 239 [2025-02-05 18:57:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1276 transitions. [2025-02-05 18:57:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1276 transitions. [2025-02-05 18:57:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-05 18:57:11,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:11,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:11,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 18:57:11,561 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1290400141, now seen corresponding path program 1 times [2025-02-05 18:57:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374567444] [2025-02-05 18:57:11,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:11,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-05 18:57:11,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-05 18:57:11,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:11,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374567444] [2025-02-05 18:57:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374567444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587932652] [2025-02-05 18:57:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:11,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:11,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:11,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:11,816 INFO L87 Difference]: Start difference. First operand 873 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:12,137 INFO L93 Difference]: Finished difference Result 1580 states and 2304 transitions. [2025-02-05 18:57:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2025-02-05 18:57:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:12,140 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:12,140 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:12,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:12,141 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1230 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:12,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1889 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4619815668202765) internal successors, (1269), 868 states have internal predecessors, (1269), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1275 transitions. [2025-02-05 18:57:12,150 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1275 transitions. Word has length 240 [2025-02-05 18:57:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:12,150 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1275 transitions. [2025-02-05 18:57:12,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1275 transitions. [2025-02-05 18:57:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 18:57:12,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:12,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:12,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 18:57:12,151 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1811120590, now seen corresponding path program 1 times [2025-02-05 18:57:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569270202] [2025-02-05 18:57:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:12,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 18:57:12,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 18:57:12,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:12,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:12,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569270202] [2025-02-05 18:57:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569270202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076579] [2025-02-05 18:57:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:12,457 INFO L87 Difference]: Start difference. First operand 873 states and 1275 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:12,798 INFO L93 Difference]: Finished difference Result 1580 states and 2302 transitions. [2025-02-05 18:57:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 241 [2025-02-05 18:57:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:12,801 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:12,801 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:12,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:12,802 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2282 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:12,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 1882 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4608294930875576) internal successors, (1268), 868 states have internal predecessors, (1268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1274 transitions. [2025-02-05 18:57:12,811 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1274 transitions. Word has length 241 [2025-02-05 18:57:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:12,811 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1274 transitions. [2025-02-05 18:57:12,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1274 transitions. [2025-02-05 18:57:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 18:57:12,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:12,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 18:57:12,813 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 701097774, now seen corresponding path program 1 times [2025-02-05 18:57:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767001889] [2025-02-05 18:57:12,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:12,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 18:57:12,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 18:57:12,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:12,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767001889] [2025-02-05 18:57:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767001889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:13,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:13,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545316116] [2025-02-05 18:57:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:13,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:13,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:13,081 INFO L87 Difference]: Start difference. First operand 873 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:13,420 INFO L93 Difference]: Finished difference Result 1580 states and 2300 transitions. [2025-02-05 18:57:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 242 [2025-02-05 18:57:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:13,425 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:13,425 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:13,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:13,427 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2274 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:13,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 1882 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4596774193548387) internal successors, (1267), 868 states have internal predecessors, (1267), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1273 transitions. [2025-02-05 18:57:13,435 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1273 transitions. Word has length 242 [2025-02-05 18:57:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:13,436 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1273 transitions. [2025-02-05 18:57:13,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1273 transitions. [2025-02-05 18:57:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 18:57:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:13,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:13,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 18:57:13,437 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 258422249, now seen corresponding path program 1 times [2025-02-05 18:57:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155005628] [2025-02-05 18:57:13,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 18:57:13,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 18:57:13,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:13,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155005628] [2025-02-05 18:57:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155005628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:13,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:13,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410796050] [2025-02-05 18:57:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:13,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:13,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:13,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:13,833 INFO L87 Difference]: Start difference. First operand 873 states and 1273 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:14,273 INFO L93 Difference]: Finished difference Result 1580 states and 2298 transitions. [2025-02-05 18:57:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:14,276 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 243 [2025-02-05 18:57:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:14,278 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:14,278 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:14,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:14,279 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2266 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:14,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 1882 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4585253456221199) internal successors, (1266), 868 states have internal predecessors, (1266), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1272 transitions. [2025-02-05 18:57:14,287 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1272 transitions. Word has length 243 [2025-02-05 18:57:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:14,288 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1272 transitions. [2025-02-05 18:57:14,288 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1272 transitions. [2025-02-05 18:57:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-05 18:57:14,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:14,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:14,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 18:57:14,289 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -521924247, now seen corresponding path program 1 times [2025-02-05 18:57:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855882564] [2025-02-05 18:57:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:14,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-05 18:57:14,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-05 18:57:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855882564] [2025-02-05 18:57:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855882564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062953080] [2025-02-05 18:57:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:14,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:14,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:14,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:14,610 INFO L87 Difference]: Start difference. First operand 873 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:14,929 INFO L93 Difference]: Finished difference Result 1580 states and 2296 transitions. [2025-02-05 18:57:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2025-02-05 18:57:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:14,931 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:14,931 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:14,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:14,931 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1214 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:14,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1889 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.457373271889401) internal successors, (1265), 868 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1271 transitions. [2025-02-05 18:57:14,941 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1271 transitions. Word has length 244 [2025-02-05 18:57:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:14,942 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1271 transitions. [2025-02-05 18:57:14,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1271 transitions. [2025-02-05 18:57:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 18:57:14,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:14,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:14,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 18:57:14,943 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1888482180, now seen corresponding path program 1 times [2025-02-05 18:57:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:14,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739864608] [2025-02-05 18:57:14,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:14,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 18:57:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 18:57:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:15,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:15,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739864608] [2025-02-05 18:57:15,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739864608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:15,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:15,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:15,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355106031] [2025-02-05 18:57:15,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:15,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:15,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:15,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:15,374 INFO L87 Difference]: Start difference. First operand 873 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:15,631 INFO L93 Difference]: Finished difference Result 1580 states and 2294 transitions. [2025-02-05 18:57:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 245 [2025-02-05 18:57:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:15,633 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:15,633 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:15,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:15,634 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1130 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:15,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2074 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:57:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.455069124423963) internal successors, (1263), 868 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1269 transitions. [2025-02-05 18:57:15,646 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1269 transitions. Word has length 245 [2025-02-05 18:57:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:15,646 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1269 transitions. [2025-02-05 18:57:15,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1269 transitions. [2025-02-05 18:57:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-05 18:57:15,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:15,647 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 18:57:15,647 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -408135363, now seen corresponding path program 1 times [2025-02-05 18:57:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144821915] [2025-02-05 18:57:15,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:15,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:15,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-05 18:57:15,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-05 18:57:15,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:15,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:16,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:16,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144821915] [2025-02-05 18:57:16,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144821915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:16,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070898855] [2025-02-05 18:57:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:16,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:16,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:16,019 INFO L87 Difference]: Start difference. First operand 873 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:16,265 INFO L93 Difference]: Finished difference Result 1580 states and 2290 transitions. [2025-02-05 18:57:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 247 [2025-02-05 18:57:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:16,266 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:16,266 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:16,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:16,267 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1252 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:16,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2081 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:57:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4539170506912442) internal successors, (1262), 868 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1268 transitions. [2025-02-05 18:57:16,276 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1268 transitions. Word has length 247 [2025-02-05 18:57:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:16,276 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1268 transitions. [2025-02-05 18:57:16,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1268 transitions. [2025-02-05 18:57:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-05 18:57:16,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:16,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:16,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 18:57:16,277 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 96408018, now seen corresponding path program 1 times [2025-02-05 18:57:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260386984] [2025-02-05 18:57:16,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:16,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 18:57:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 18:57:16,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:16,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260386984] [2025-02-05 18:57:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260386984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154784613] [2025-02-05 18:57:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:16,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:16,705 INFO L87 Difference]: Start difference. First operand 873 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:57:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:17,011 INFO L93 Difference]: Finished difference Result 1580 states and 2288 transitions. [2025-02-05 18:57:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:17,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 248 [2025-02-05 18:57:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:17,012 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:17,012 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:17,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:17,013 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1165 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:17,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2078 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4527649769585254) internal successors, (1261), 868 states have internal predecessors, (1261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1267 transitions. [2025-02-05 18:57:17,022 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1267 transitions. Word has length 248 [2025-02-05 18:57:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:17,023 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1267 transitions. [2025-02-05 18:57:17,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:57:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1267 transitions. [2025-02-05 18:57:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 18:57:17,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:17,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 18:57:17,024 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:17,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 173959691, now seen corresponding path program 1 times [2025-02-05 18:57:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:17,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554078468] [2025-02-05 18:57:17,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:17,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 18:57:17,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 18:57:17,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554078468] [2025-02-05 18:57:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554078468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70139501] [2025-02-05 18:57:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:17,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:17,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:17,759 INFO L87 Difference]: Start difference. First operand 873 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:18,206 INFO L93 Difference]: Finished difference Result 1586 states and 2294 transitions. [2025-02-05 18:57:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:57:18,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 249 [2025-02-05 18:57:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:18,209 INFO L225 Difference]: With dead ends: 1586 [2025-02-05 18:57:18,209 INFO L226 Difference]: Without dead ends: 877 [2025-02-05 18:57:18,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:18,210 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 2 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:18,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3961 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-05 18:57:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 875. [2025-02-05 18:57:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4517241379310344) internal successors, (1263), 870 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1269 transitions. [2025-02-05 18:57:18,220 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1269 transitions. Word has length 249 [2025-02-05 18:57:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:18,221 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1269 transitions. [2025-02-05 18:57:18,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1269 transitions. [2025-02-05 18:57:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 18:57:18,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:18,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 18:57:18,222 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash -889135950, now seen corresponding path program 1 times [2025-02-05 18:57:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416384031] [2025-02-05 18:57:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 18:57:18,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 18:57:18,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:18,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416384031] [2025-02-05 18:57:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416384031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259036976] [2025-02-05 18:57:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:18,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:18,826 INFO L87 Difference]: Start difference. First operand 875 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:19,258 INFO L93 Difference]: Finished difference Result 1584 states and 2290 transitions. [2025-02-05 18:57:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 250 [2025-02-05 18:57:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:19,260 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:19,260 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:19,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:19,261 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 1106 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:19,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 2976 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.450574712643678) internal successors, (1262), 870 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1268 transitions. [2025-02-05 18:57:19,275 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1268 transitions. Word has length 250 [2025-02-05 18:57:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:19,276 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1268 transitions. [2025-02-05 18:57:19,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1268 transitions. [2025-02-05 18:57:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 18:57:19,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:19,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 18:57:19,277 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1964806414, now seen corresponding path program 1 times [2025-02-05 18:57:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246106827] [2025-02-05 18:57:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:19,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 18:57:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 18:57:19,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:19,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:19,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:19,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246106827] [2025-02-05 18:57:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246106827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:19,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535833662] [2025-02-05 18:57:19,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:19,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:19,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:19,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:19,753 INFO L87 Difference]: Start difference. First operand 875 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:20,086 INFO L93 Difference]: Finished difference Result 1584 states and 2288 transitions. [2025-02-05 18:57:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 251 [2025-02-05 18:57:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:20,088 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:20,088 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:20,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:20,088 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 1103 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:20,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1995 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4494252873563218) internal successors, (1261), 870 states have internal predecessors, (1261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1267 transitions. [2025-02-05 18:57:20,098 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1267 transitions. Word has length 251 [2025-02-05 18:57:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:20,098 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1267 transitions. [2025-02-05 18:57:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1267 transitions. [2025-02-05 18:57:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 18:57:20,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:20,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:20,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 18:57:20,099 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -896144816, now seen corresponding path program 1 times [2025-02-05 18:57:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414796536] [2025-02-05 18:57:20,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:20,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 18:57:20,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 18:57:20,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:20,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414796536] [2025-02-05 18:57:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414796536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:20,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684640586] [2025-02-05 18:57:20,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:20,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:20,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:20,500 INFO L87 Difference]: Start difference. First operand 875 states and 1267 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:20,790 INFO L93 Difference]: Finished difference Result 1584 states and 2286 transitions. [2025-02-05 18:57:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:20,791 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 252 [2025-02-05 18:57:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:20,792 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:20,792 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:20,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:20,793 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 1117 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:20,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 2038 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4482758620689655) internal successors, (1260), 870 states have internal predecessors, (1260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1266 transitions. [2025-02-05 18:57:20,802 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1266 transitions. Word has length 252 [2025-02-05 18:57:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1266 transitions. [2025-02-05 18:57:20,802 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1266 transitions. [2025-02-05 18:57:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 18:57:20,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:20,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 18:57:20,820 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1535287412, now seen corresponding path program 1 times [2025-02-05 18:57:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126687326] [2025-02-05 18:57:20,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:20,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 18:57:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 18:57:20,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:20,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126687326] [2025-02-05 18:57:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126687326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:21,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000342708] [2025-02-05 18:57:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:21,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:21,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:21,247 INFO L87 Difference]: Start difference. First operand 875 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:21,651 INFO L93 Difference]: Finished difference Result 1584 states and 2284 transitions. [2025-02-05 18:57:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 253 [2025-02-05 18:57:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:21,653 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:21,653 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:21,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:21,655 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 1076 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:21,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1868 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4471264367816092) internal successors, (1259), 870 states have internal predecessors, (1259), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1265 transitions. [2025-02-05 18:57:21,665 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1265 transitions. Word has length 253 [2025-02-05 18:57:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:21,665 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1265 transitions. [2025-02-05 18:57:21,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1265 transitions. [2025-02-05 18:57:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 18:57:21,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:21,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 18:57:21,666 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash -997444223, now seen corresponding path program 1 times [2025-02-05 18:57:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760244270] [2025-02-05 18:57:21,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:21,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 18:57:21,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 18:57:21,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760244270] [2025-02-05 18:57:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760244270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:22,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:22,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597396906] [2025-02-05 18:57:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:22,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:22,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:22,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:22,101 INFO L87 Difference]: Start difference. First operand 875 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:22,447 INFO L93 Difference]: Finished difference Result 1584 states and 2282 transitions. [2025-02-05 18:57:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 254 [2025-02-05 18:57:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:22,449 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:22,449 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:22,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:22,450 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 1099 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:22,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1991 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.445977011494253) internal successors, (1258), 870 states have internal predecessors, (1258), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1264 transitions. [2025-02-05 18:57:22,461 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1264 transitions. Word has length 254 [2025-02-05 18:57:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:22,461 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1264 transitions. [2025-02-05 18:57:22,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1264 transitions. [2025-02-05 18:57:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 18:57:22,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:22,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:22,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 18:57:22,462 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:22,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash -589529724, now seen corresponding path program 1 times [2025-02-05 18:57:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40240885] [2025-02-05 18:57:22,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:22,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 18:57:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 18:57:22,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:22,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:22,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:22,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40240885] [2025-02-05 18:57:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40240885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:22,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:22,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459280951] [2025-02-05 18:57:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:22,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:22,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:22,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:22,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:22,780 INFO L87 Difference]: Start difference. First operand 875 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:57:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:23,033 INFO L93 Difference]: Finished difference Result 1584 states and 2280 transitions. [2025-02-05 18:57:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 255 [2025-02-05 18:57:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:23,035 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:23,035 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:23,036 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-05 18:57:23,036 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 1158 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:23,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 2068 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:57:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4448275862068964) internal successors, (1257), 870 states have internal predecessors, (1257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1263 transitions. [2025-02-05 18:57:23,045 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1263 transitions. Word has length 255 [2025-02-05 18:57:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1263 transitions. [2025-02-05 18:57:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 18:57:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1263 transitions. [2025-02-05 18:57:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 18:57:23,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:23,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:23,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 18:57:23,046 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -955082235, now seen corresponding path program 1 times [2025-02-05 18:57:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289576754] [2025-02-05 18:57:23,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:23,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 18:57:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 18:57:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:23,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:23,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289576754] [2025-02-05 18:57:23,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289576754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898453455] [2025-02-05 18:57:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:23,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:23,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:23,542 INFO L87 Difference]: Start difference. First operand 875 states and 1263 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:23,882 INFO L93 Difference]: Finished difference Result 1584 states and 2278 transitions. [2025-02-05 18:57:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:23,883 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 256 [2025-02-05 18:57:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:23,884 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 18:57:23,884 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:23,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:23,885 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 2214 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:23,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 2032 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-02-05 18:57:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 870 states have (on average 1.4436781609195402) internal successors, (1256), 870 states have internal predecessors, (1256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1262 transitions. [2025-02-05 18:57:23,895 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1262 transitions. Word has length 256 [2025-02-05 18:57:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1262 transitions. [2025-02-05 18:57:23,897 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1262 transitions. [2025-02-05 18:57:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 18:57:23,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:23,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:23,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 18:57:23,898 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:23,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2015844999, now seen corresponding path program 1 times [2025-02-05 18:57:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:23,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752577179] [2025-02-05 18:57:23,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:23,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 18:57:24,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 18:57:24,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:24,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752577179] [2025-02-05 18:57:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752577179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:24,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:57:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800286339] [2025-02-05 18:57:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:24,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:57:24,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:24,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:57:24,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:24,305 INFO L87 Difference]: Start difference. First operand 875 states and 1262 transitions. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:24,683 INFO L93 Difference]: Finished difference Result 1586 states and 2278 transitions. [2025-02-05 18:57:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 257 [2025-02-05 18:57:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:24,685 INFO L225 Difference]: With dead ends: 1586 [2025-02-05 18:57:24,685 INFO L226 Difference]: Without dead ends: 875 [2025-02-05 18:57:24,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:57:24,686 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 2 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:24,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2900 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-05 18:57:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2025-02-05 18:57:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4435483870967742) internal successors, (1253), 868 states have internal predecessors, (1253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1259 transitions. [2025-02-05 18:57:24,697 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1259 transitions. Word has length 257 [2025-02-05 18:57:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:24,698 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1259 transitions. [2025-02-05 18:57:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1259 transitions. [2025-02-05 18:57:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 18:57:24,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:24,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 18:57:24,699 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1262593588, now seen corresponding path program 1 times [2025-02-05 18:57:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651486499] [2025-02-05 18:57:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:24,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 18:57:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 18:57:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651486499] [2025-02-05 18:57:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651486499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531449777] [2025-02-05 18:57:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:25,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:25,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:25,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:25,067 INFO L87 Difference]: Start difference. First operand 873 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:25,361 INFO L93 Difference]: Finished difference Result 1580 states and 2270 transitions. [2025-02-05 18:57:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 257 [2025-02-05 18:57:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:25,362 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:25,362 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:25,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:25,363 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 2206 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:25,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 2030 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4423963133640554) internal successors, (1252), 868 states have internal predecessors, (1252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1258 transitions. [2025-02-05 18:57:25,371 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1258 transitions. Word has length 257 [2025-02-05 18:57:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1258 transitions. [2025-02-05 18:57:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1258 transitions. [2025-02-05 18:57:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 18:57:25,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:25,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:25,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 18:57:25,373 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:25,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1809257551, now seen corresponding path program 1 times [2025-02-05 18:57:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027198968] [2025-02-05 18:57:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:25,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 18:57:25,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 18:57:25,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:25,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027198968] [2025-02-05 18:57:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027198968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:25,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036881333] [2025-02-05 18:57:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:25,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:25,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:25,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:25,794 INFO L87 Difference]: Start difference. First operand 873 states and 1258 transitions. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:26,149 INFO L93 Difference]: Finished difference Result 1580 states and 2268 transitions. [2025-02-05 18:57:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 258 [2025-02-05 18:57:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:26,155 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:26,155 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:26,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:26,156 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 2170 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:26,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 1976 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4412442396313363) internal successors, (1251), 868 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1257 transitions. [2025-02-05 18:57:26,168 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1257 transitions. Word has length 258 [2025-02-05 18:57:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:26,169 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1257 transitions. [2025-02-05 18:57:26,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1257 transitions. [2025-02-05 18:57:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 18:57:26,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:26,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:26,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 18:57:26,170 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:26,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:26,171 INFO L85 PathProgramCache]: Analyzing trace with hash -342383198, now seen corresponding path program 1 times [2025-02-05 18:57:26,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:26,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411253774] [2025-02-05 18:57:26,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:26,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 18:57:26,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 18:57:26,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:26,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411253774] [2025-02-05 18:57:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411253774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498011939] [2025-02-05 18:57:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:26,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:26,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:26,576 INFO L87 Difference]: Start difference. First operand 873 states and 1257 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:26,910 INFO L93 Difference]: Finished difference Result 1580 states and 2266 transitions. [2025-02-05 18:57:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:26,911 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 259 [2025-02-05 18:57:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:26,912 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:26,912 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:26,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:26,913 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 2160 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:26,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 1976 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4400921658986174) internal successors, (1250), 868 states have internal predecessors, (1250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1256 transitions. [2025-02-05 18:57:26,926 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1256 transitions. Word has length 259 [2025-02-05 18:57:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:26,926 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1256 transitions. [2025-02-05 18:57:26,926 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1256 transitions. [2025-02-05 18:57:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-05 18:57:26,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:26,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 18:57:26,927 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1955078496, now seen corresponding path program 1 times [2025-02-05 18:57:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222764136] [2025-02-05 18:57:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:26,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 18:57:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 18:57:27,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222764136] [2025-02-05 18:57:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222764136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:27,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:27,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218795938] [2025-02-05 18:57:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:27,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:27,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:27,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:27,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:27,322 INFO L87 Difference]: Start difference. First operand 873 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:27,656 INFO L93 Difference]: Finished difference Result 1580 states and 2264 transitions. [2025-02-05 18:57:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 260 [2025-02-05 18:57:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:27,658 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:27,658 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:27,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:27,659 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 1089 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:27,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1983 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4389400921658986) internal successors, (1249), 868 states have internal predecessors, (1249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1255 transitions. [2025-02-05 18:57:27,676 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1255 transitions. Word has length 260 [2025-02-05 18:57:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:27,677 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1255 transitions. [2025-02-05 18:57:27,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1255 transitions. [2025-02-05 18:57:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 18:57:27,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:27,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 18:57:27,678 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1909482459, now seen corresponding path program 1 times [2025-02-05 18:57:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234134809] [2025-02-05 18:57:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 18:57:27,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 18:57:27,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:27,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234134809] [2025-02-05 18:57:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234134809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:28,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:28,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801436708] [2025-02-05 18:57:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:28,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:28,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:28,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:28,078 INFO L87 Difference]: Start difference. First operand 873 states and 1255 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:28,446 INFO L93 Difference]: Finished difference Result 1580 states and 2262 transitions. [2025-02-05 18:57:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:28,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 261 [2025-02-05 18:57:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:28,448 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:28,448 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:28,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:28,449 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1057 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:28,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1859 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4377880184331797) internal successors, (1248), 868 states have internal predecessors, (1248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1254 transitions. [2025-02-05 18:57:28,458 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1254 transitions. Word has length 261 [2025-02-05 18:57:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:28,458 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1254 transitions. [2025-02-05 18:57:28,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1254 transitions. [2025-02-05 18:57:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 18:57:28,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:28,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:28,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 18:57:28,459 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:28,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash -833684055, now seen corresponding path program 1 times [2025-02-05 18:57:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579885560] [2025-02-05 18:57:28,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:28,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 18:57:28,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 18:57:28,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:28,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579885560] [2025-02-05 18:57:28,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579885560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:28,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:28,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534158328] [2025-02-05 18:57:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:28,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:28,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:28,945 INFO L87 Difference]: Start difference. First operand 873 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:29,363 INFO L93 Difference]: Finished difference Result 1580 states and 2260 transitions. [2025-02-05 18:57:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 262 [2025-02-05 18:57:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:29,365 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:29,365 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:29,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:29,366 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2104 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:29,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2104 Valid, 1852 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4366359447004609) internal successors, (1247), 868 states have internal predecessors, (1247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1253 transitions. [2025-02-05 18:57:29,380 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1253 transitions. Word has length 262 [2025-02-05 18:57:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:29,380 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1253 transitions. [2025-02-05 18:57:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1253 transitions. [2025-02-05 18:57:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 18:57:29,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:29,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:29,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 18:57:29,381 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -568218499, now seen corresponding path program 1 times [2025-02-05 18:57:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503741671] [2025-02-05 18:57:29,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:29,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 18:57:29,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 18:57:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:29,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:29,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503741671] [2025-02-05 18:57:29,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503741671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:29,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:29,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220886403] [2025-02-05 18:57:29,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:29,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:29,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:29,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:29,742 INFO L87 Difference]: Start difference. First operand 873 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:30,119 INFO L93 Difference]: Finished difference Result 1580 states and 2258 transitions. [2025-02-05 18:57:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 263 [2025-02-05 18:57:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:30,121 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:30,121 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:30,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:30,121 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1055 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:30,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1859 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.435483870967742) internal successors, (1246), 868 states have internal predecessors, (1246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1252 transitions. [2025-02-05 18:57:30,131 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1252 transitions. Word has length 263 [2025-02-05 18:57:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:30,132 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1252 transitions. [2025-02-05 18:57:30,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1252 transitions. [2025-02-05 18:57:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 18:57:30,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:30,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 18:57:30,133 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1303510448, now seen corresponding path program 1 times [2025-02-05 18:57:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200657298] [2025-02-05 18:57:30,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:30,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 18:57:30,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 18:57:30,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:30,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200657298] [2025-02-05 18:57:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200657298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498387646] [2025-02-05 18:57:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:30,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:30,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:30,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:30,578 INFO L87 Difference]: Start difference. First operand 873 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:30,943 INFO L93 Difference]: Finished difference Result 1580 states and 2256 transitions. [2025-02-05 18:57:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 264 [2025-02-05 18:57:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:30,945 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:30,945 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:30,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:30,946 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1054 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:30,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1859 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4343317972350231) internal successors, (1245), 868 states have internal predecessors, (1245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1251 transitions. [2025-02-05 18:57:30,954 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1251 transitions. Word has length 264 [2025-02-05 18:57:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:30,954 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1251 transitions. [2025-02-05 18:57:30,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1251 transitions. [2025-02-05 18:57:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 18:57:30,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:30,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:30,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 18:57:30,955 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash -633059693, now seen corresponding path program 1 times [2025-02-05 18:57:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692260362] [2025-02-05 18:57:30,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 18:57:31,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 18:57:31,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:31,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692260362] [2025-02-05 18:57:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692260362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991090445] [2025-02-05 18:57:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:31,339 INFO L87 Difference]: Start difference. First operand 873 states and 1251 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:31,706 INFO L93 Difference]: Finished difference Result 1580 states and 2254 transitions. [2025-02-05 18:57:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:31,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 265 [2025-02-05 18:57:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:31,709 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:31,709 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:31,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:31,710 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2086 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:31,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1852 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.433179723502304) internal successors, (1244), 868 states have internal predecessors, (1244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1250 transitions. [2025-02-05 18:57:31,719 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1250 transitions. Word has length 265 [2025-02-05 18:57:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:31,719 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1250 transitions. [2025-02-05 18:57:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1250 transitions. [2025-02-05 18:57:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 18:57:31,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:31,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:31,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 18:57:31,720 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 576410911, now seen corresponding path program 1 times [2025-02-05 18:57:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556468239] [2025-02-05 18:57:31,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 18:57:31,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 18:57:31,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:31,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556468239] [2025-02-05 18:57:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556468239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:32,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63916909] [2025-02-05 18:57:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:32,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:32,109 INFO L87 Difference]: Start difference. First operand 873 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:32,478 INFO L93 Difference]: Finished difference Result 1580 states and 2252 transitions. [2025-02-05 18:57:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:32,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 266 [2025-02-05 18:57:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:32,479 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:32,479 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:32,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:32,480 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2080 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:32,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 1852 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4320276497695852) internal successors, (1243), 868 states have internal predecessors, (1243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1249 transitions. [2025-02-05 18:57:32,489 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1249 transitions. Word has length 266 [2025-02-05 18:57:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:32,489 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1249 transitions. [2025-02-05 18:57:32,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1249 transitions. [2025-02-05 18:57:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-05 18:57:32,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:32,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:32,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 18:57:32,490 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:32,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 333600413, now seen corresponding path program 1 times [2025-02-05 18:57:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886504524] [2025-02-05 18:57:32,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 18:57:32,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 18:57:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886504524] [2025-02-05 18:57:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886504524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:32,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:32,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524681740] [2025-02-05 18:57:32,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:32,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:32,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:32,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:32,874 INFO L87 Difference]: Start difference. First operand 873 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:33,235 INFO L93 Difference]: Finished difference Result 1580 states and 2250 transitions. [2025-02-05 18:57:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:33,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 267 [2025-02-05 18:57:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:33,237 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:33,237 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:33,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:33,238 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1051 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:33,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1859 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4308755760368663) internal successors, (1242), 868 states have internal predecessors, (1242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1248 transitions. [2025-02-05 18:57:33,249 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1248 transitions. Word has length 267 [2025-02-05 18:57:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:33,249 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1248 transitions. [2025-02-05 18:57:33,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1248 transitions. [2025-02-05 18:57:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 18:57:33,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:33,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 18:57:33,250 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 503515678, now seen corresponding path program 1 times [2025-02-05 18:57:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847017630] [2025-02-05 18:57:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 18:57:33,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 18:57:33,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847017630] [2025-02-05 18:57:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847017630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279078331] [2025-02-05 18:57:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:33,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:33,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:33,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:33,645 INFO L87 Difference]: Start difference. First operand 873 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:34,007 INFO L93 Difference]: Finished difference Result 1580 states and 2248 transitions. [2025-02-05 18:57:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 268 [2025-02-05 18:57:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:34,009 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:34,009 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:34,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:34,009 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2068 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2068 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:34,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2068 Valid, 1852 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4297235023041475) internal successors, (1241), 868 states have internal predecessors, (1241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1247 transitions. [2025-02-05 18:57:34,018 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1247 transitions. Word has length 268 [2025-02-05 18:57:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:34,018 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1247 transitions. [2025-02-05 18:57:34,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1247 transitions. [2025-02-05 18:57:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 18:57:34,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:34,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 18:57:34,019 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -14205029, now seen corresponding path program 1 times [2025-02-05 18:57:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:34,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520593268] [2025-02-05 18:57:34,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 18:57:34,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 18:57:34,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:34,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:34,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520593268] [2025-02-05 18:57:34,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520593268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:34,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:34,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464062084] [2025-02-05 18:57:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:34,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:34,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:34,387 INFO L87 Difference]: Start difference. First operand 873 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:34,744 INFO L93 Difference]: Finished difference Result 1580 states and 2246 transitions. [2025-02-05 18:57:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 269 [2025-02-05 18:57:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:34,745 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:34,745 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:34,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:34,746 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2062 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:34,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 1852 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4285714285714286) internal successors, (1240), 868 states have internal predecessors, (1240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1246 transitions. [2025-02-05 18:57:34,755 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1246 transitions. Word has length 269 [2025-02-05 18:57:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:34,755 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1246 transitions. [2025-02-05 18:57:34,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1246 transitions. [2025-02-05 18:57:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 18:57:34,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:34,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 18:57:34,756 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:34,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash -966139351, now seen corresponding path program 1 times [2025-02-05 18:57:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:34,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972599787] [2025-02-05 18:57:34,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:34,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 18:57:34,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 18:57:34,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972599787] [2025-02-05 18:57:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972599787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:35,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998960875] [2025-02-05 18:57:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:35,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:35,139 INFO L87 Difference]: Start difference. First operand 873 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:35,499 INFO L93 Difference]: Finished difference Result 1580 states and 2244 transitions. [2025-02-05 18:57:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 270 [2025-02-05 18:57:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:35,500 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:35,500 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:35,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:35,501 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2056 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:35,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 1852 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4274193548387097) internal successors, (1239), 868 states have internal predecessors, (1239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1245 transitions. [2025-02-05 18:57:35,509 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1245 transitions. Word has length 270 [2025-02-05 18:57:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:35,509 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1245 transitions. [2025-02-05 18:57:35,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1245 transitions. [2025-02-05 18:57:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 18:57:35,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:35,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:35,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 18:57:35,512 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1178752387, now seen corresponding path program 1 times [2025-02-05 18:57:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540841171] [2025-02-05 18:57:35,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:35,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 18:57:35,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 18:57:35,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:35,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:35,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540841171] [2025-02-05 18:57:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540841171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978219060] [2025-02-05 18:57:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:35,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:35,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:35,913 INFO L87 Difference]: Start difference. First operand 873 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:36,293 INFO L93 Difference]: Finished difference Result 1580 states and 2242 transitions. [2025-02-05 18:57:36,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:36,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 271 [2025-02-05 18:57:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:36,294 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:36,294 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:36,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:36,295 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2050 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:36,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 1852 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4262672811059909) internal successors, (1238), 868 states have internal predecessors, (1238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1244 transitions. [2025-02-05 18:57:36,304 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1244 transitions. Word has length 271 [2025-02-05 18:57:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:36,305 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1244 transitions. [2025-02-05 18:57:36,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1244 transitions. [2025-02-05 18:57:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 18:57:36,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:36,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:36,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 18:57:36,306 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:36,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:36,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1226640847, now seen corresponding path program 1 times [2025-02-05 18:57:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:36,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498190123] [2025-02-05 18:57:36,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:36,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 18:57:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 18:57:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498190123] [2025-02-05 18:57:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498190123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74559260] [2025-02-05 18:57:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:36,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:36,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:36,734 INFO L87 Difference]: Start difference. First operand 873 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:37,089 INFO L93 Difference]: Finished difference Result 1580 states and 2240 transitions. [2025-02-05 18:57:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 272 [2025-02-05 18:57:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:37,090 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:37,090 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:37,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:37,091 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2044 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:37,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 1852 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4251152073732718) internal successors, (1237), 868 states have internal predecessors, (1237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1243 transitions. [2025-02-05 18:57:37,101 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1243 transitions. Word has length 272 [2025-02-05 18:57:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:37,101 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1243 transitions. [2025-02-05 18:57:37,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1243 transitions. [2025-02-05 18:57:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 18:57:37,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:37,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:37,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 18:57:37,103 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -356798334, now seen corresponding path program 1 times [2025-02-05 18:57:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17044994] [2025-02-05 18:57:37,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:37,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 18:57:37,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 18:57:37,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:37,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17044994] [2025-02-05 18:57:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17044994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:37,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:37,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075072615] [2025-02-05 18:57:37,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:37,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:37,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:37,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:37,481 INFO L87 Difference]: Start difference. First operand 873 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:37,839 INFO L93 Difference]: Finished difference Result 1580 states and 2238 transitions. [2025-02-05 18:57:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 273 [2025-02-05 18:57:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:37,840 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:37,840 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:37,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:37,841 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1045 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:37,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1859 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.423963133640553) internal successors, (1236), 868 states have internal predecessors, (1236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1242 transitions. [2025-02-05 18:57:37,850 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1242 transitions. Word has length 273 [2025-02-05 18:57:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:37,850 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1242 transitions. [2025-02-05 18:57:37,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1242 transitions. [2025-02-05 18:57:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 18:57:37,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:37,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 18:57:37,851 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1430370719, now seen corresponding path program 1 times [2025-02-05 18:57:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699213700] [2025-02-05 18:57:37,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:37,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 18:57:37,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 18:57:37,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:37,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699213700] [2025-02-05 18:57:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699213700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:38,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:38,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319489998] [2025-02-05 18:57:38,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:38,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:38,245 INFO L87 Difference]: Start difference. First operand 873 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:38,596 INFO L93 Difference]: Finished difference Result 1580 states and 2236 transitions. [2025-02-05 18:57:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:38,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 274 [2025-02-05 18:57:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:38,597 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 18:57:38,597 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 18:57:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:38,598 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 2032 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:38,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 1852 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 18:57:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 18:57:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.422811059907834) internal successors, (1235), 868 states have internal predecessors, (1235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1241 transitions. [2025-02-05 18:57:38,606 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1241 transitions. Word has length 274 [2025-02-05 18:57:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1241 transitions. [2025-02-05 18:57:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1241 transitions. [2025-02-05 18:57:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 18:57:38,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:38,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:38,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-05 18:57:38,608 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:38,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash 671736339, now seen corresponding path program 1 times [2025-02-05 18:57:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109480878] [2025-02-05 18:57:38,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:38,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 18:57:38,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 18:57:38,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:38,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109480878] [2025-02-05 18:57:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109480878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081869308] [2025-02-05 18:57:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:39,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:39,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:39,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:39,383 INFO L87 Difference]: Start difference. First operand 873 states and 1241 transitions. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:39,834 INFO L93 Difference]: Finished difference Result 1720 states and 2386 transitions. [2025-02-05 18:57:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:57:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 275 [2025-02-05 18:57:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:39,836 INFO L225 Difference]: With dead ends: 1720 [2025-02-05 18:57:39,836 INFO L226 Difference]: Without dead ends: 1013 [2025-02-05 18:57:39,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:39,837 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 22 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4068 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:39,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4068 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:57:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-05 18:57:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2025-02-05 18:57:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1006 states have (on average 1.374751491053678) internal successors, (1383), 1006 states have internal predecessors, (1383), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1389 transitions. [2025-02-05 18:57:39,854 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1389 transitions. Word has length 275 [2025-02-05 18:57:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:39,854 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1389 transitions. [2025-02-05 18:57:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1389 transitions. [2025-02-05 18:57:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 18:57:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:39,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-05 18:57:39,856 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1237353360, now seen corresponding path program 1 times [2025-02-05 18:57:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138488493] [2025-02-05 18:57:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:39,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 18:57:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 18:57:40,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:40,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138488493] [2025-02-05 18:57:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138488493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:40,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:40,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041803415] [2025-02-05 18:57:40,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:40,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:40,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:40,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:40,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:40,780 INFO L87 Difference]: Start difference. First operand 1011 states and 1389 transitions. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:41,282 INFO L93 Difference]: Finished difference Result 1864 states and 2540 transitions. [2025-02-05 18:57:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:57:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 276 [2025-02-05 18:57:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:41,284 INFO L225 Difference]: With dead ends: 1864 [2025-02-05 18:57:41,284 INFO L226 Difference]: Without dead ends: 1019 [2025-02-05 18:57:41,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:41,285 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 1105 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:41,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 2414 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:57:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-02-05 18:57:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2025-02-05 18:57:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1012 states have (on average 1.3725296442687747) internal successors, (1389), 1012 states have internal predecessors, (1389), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1395 transitions. [2025-02-05 18:57:41,297 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1395 transitions. Word has length 276 [2025-02-05 18:57:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:41,297 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1395 transitions. [2025-02-05 18:57:41,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1395 transitions. [2025-02-05 18:57:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-02-05 18:57:41,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:41,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:41,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-05 18:57:41,299 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:41,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2003632021, now seen corresponding path program 1 times [2025-02-05 18:57:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391569668] [2025-02-05 18:57:41,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:41,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-02-05 18:57:41,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-02-05 18:57:41,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391569668] [2025-02-05 18:57:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391569668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:57:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842331588] [2025-02-05 18:57:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:41,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:57:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:41,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:57:41,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:57:41,819 INFO L87 Difference]: Start difference. First operand 1017 states and 1395 transitions. Second operand has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:42,371 INFO L93 Difference]: Finished difference Result 1942 states and 2647 transitions. [2025-02-05 18:57:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:57:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 277 [2025-02-05 18:57:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:42,373 INFO L225 Difference]: With dead ends: 1942 [2025-02-05 18:57:42,373 INFO L226 Difference]: Without dead ends: 1021 [2025-02-05 18:57:42,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:57:42,374 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 1206 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 5020 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:42,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 5020 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:57:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-05 18:57:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1019. [2025-02-05 18:57:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1014 states have (on average 1.370808678500986) internal successors, (1390), 1014 states have internal predecessors, (1390), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 18:57:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1396 transitions. [2025-02-05 18:57:42,383 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1396 transitions. Word has length 277 [2025-02-05 18:57:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1396 transitions. [2025-02-05 18:57:42,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1396 transitions. [2025-02-05 18:57:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 18:57:42,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:42,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:42,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-05 18:57:42,385 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:42,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1627070923, now seen corresponding path program 1 times [2025-02-05 18:57:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294787030] [2025-02-05 18:57:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:42,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 18:57:42,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 18:57:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 18:57:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:43,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294787030] [2025-02-05 18:57:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294787030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:57:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787412297] [2025-02-05 18:57:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:43,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:57:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:43,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:57:43,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:43,146 INFO L87 Difference]: Start difference. First operand 1019 states and 1396 transitions. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:43,714 INFO L93 Difference]: Finished difference Result 2234 states and 2963 transitions. [2025-02-05 18:57:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:57:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 278 [2025-02-05 18:57:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:43,716 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:43,716 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:43,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:57:43,717 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 1678 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:43,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 4039 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:57:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3124544792425346) internal successors, (1802), 1373 states have internal predecessors, (1802), 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-05 18:57:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1814 transitions. [2025-02-05 18:57:43,734 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1814 transitions. Word has length 278 [2025-02-05 18:57:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:43,734 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1814 transitions. [2025-02-05 18:57:43,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 18:57:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1814 transitions. [2025-02-05 18:57:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 18:57:43,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:43,738 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:43,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-05 18:57:43,738 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -323564769, now seen corresponding path program 1 times [2025-02-05 18:57:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650779137] [2025-02-05 18:57:43,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:43,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 18:57:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 18:57:44,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:44,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650779137] [2025-02-05 18:57:44,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650779137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:44,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:44,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511492069] [2025-02-05 18:57:44,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:44,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:44,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:44,630 INFO L87 Difference]: Start difference. First operand 1381 states and 1814 transitions. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:44,996 INFO L93 Difference]: Finished difference Result 2234 states and 2962 transitions. [2025-02-05 18:57:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 706 [2025-02-05 18:57:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:44,998 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:44,998 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:44,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:44,999 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1139 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:44,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1857 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.311726147123088) internal successors, (1801), 1373 states have internal predecessors, (1801), 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-05 18:57:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1813 transitions. [2025-02-05 18:57:45,017 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1813 transitions. Word has length 706 [2025-02-05 18:57:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:45,017 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1813 transitions. [2025-02-05 18:57:45,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1813 transitions. [2025-02-05 18:57:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 18:57:45,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:45,021 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-05 18:57:45,021 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:45,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash -691986007, now seen corresponding path program 1 times [2025-02-05 18:57:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928942021] [2025-02-05 18:57:45,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 18:57:45,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 18:57:45,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:45,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928942021] [2025-02-05 18:57:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928942021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246744593] [2025-02-05 18:57:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:45,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:45,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:45,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:45,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:45,874 INFO L87 Difference]: Start difference. First operand 1381 states and 1813 transitions. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:46,213 INFO L93 Difference]: Finished difference Result 2234 states and 2960 transitions. [2025-02-05 18:57:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 707 [2025-02-05 18:57:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:46,215 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:46,215 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:46,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:46,216 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 2075 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:46,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1850 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3109978150036417) internal successors, (1800), 1373 states have internal predecessors, (1800), 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-05 18:57:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1812 transitions. [2025-02-05 18:57:46,236 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1812 transitions. Word has length 707 [2025-02-05 18:57:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:46,236 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1812 transitions. [2025-02-05 18:57:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1812 transitions. [2025-02-05 18:57:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-02-05 18:57:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:46,240 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-02-05 18:57:46,240 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -690306192, now seen corresponding path program 1 times [2025-02-05 18:57:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601420401] [2025-02-05 18:57:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:46,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-02-05 18:57:46,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-02-05 18:57:46,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:46,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601420401] [2025-02-05 18:57:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601420401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438572815] [2025-02-05 18:57:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:47,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:47,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:47,105 INFO L87 Difference]: Start difference. First operand 1381 states and 1812 transitions. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:47,447 INFO L93 Difference]: Finished difference Result 2234 states and 2958 transitions. [2025-02-05 18:57:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:47,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 708 [2025-02-05 18:57:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:47,449 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:47,449 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:47,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:47,450 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1123 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:47,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1857 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3102694828841952) internal successors, (1799), 1373 states have internal predecessors, (1799), 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-05 18:57:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1811 transitions. [2025-02-05 18:57:47,467 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1811 transitions. Word has length 708 [2025-02-05 18:57:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:47,467 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1811 transitions. [2025-02-05 18:57:47,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1811 transitions. [2025-02-05 18:57:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-02-05 18:57:47,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:47,471 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:47,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-02-05 18:57:47,471 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:47,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1245274714, now seen corresponding path program 1 times [2025-02-05 18:57:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935377452] [2025-02-05 18:57:47,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 18:57:47,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 18:57:47,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:47,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935377452] [2025-02-05 18:57:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935377452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326995828] [2025-02-05 18:57:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:48,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:48,416 INFO L87 Difference]: Start difference. First operand 1381 states and 1811 transitions. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:48,741 INFO L93 Difference]: Finished difference Result 2234 states and 2956 transitions. [2025-02-05 18:57:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:48,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 709 [2025-02-05 18:57:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:48,743 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:48,743 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:48,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:48,744 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1115 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:48,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1857 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3095411507647488) internal successors, (1798), 1373 states have internal predecessors, (1798), 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-05 18:57:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1810 transitions. [2025-02-05 18:57:48,759 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1810 transitions. Word has length 709 [2025-02-05 18:57:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:48,759 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1810 transitions. [2025-02-05 18:57:48,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1810 transitions. [2025-02-05 18:57:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 18:57:48,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:48,763 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-02-05 18:57:48,763 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:48,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1723524799, now seen corresponding path program 1 times [2025-02-05 18:57:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:48,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606888376] [2025-02-05 18:57:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:48,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 18:57:49,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 18:57:49,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:49,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606888376] [2025-02-05 18:57:49,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606888376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:49,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:49,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114470082] [2025-02-05 18:57:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:49,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:49,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:49,633 INFO L87 Difference]: Start difference. First operand 1381 states and 1810 transitions. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:49,954 INFO L93 Difference]: Finished difference Result 2234 states and 2954 transitions. [2025-02-05 18:57:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:49,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 710 [2025-02-05 18:57:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:49,956 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:49,956 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:49,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:49,957 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1107 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:49,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1857 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3088128186453023) internal successors, (1797), 1373 states have internal predecessors, (1797), 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-05 18:57:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1809 transitions. [2025-02-05 18:57:49,973 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1809 transitions. Word has length 710 [2025-02-05 18:57:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:49,973 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1809 transitions. [2025-02-05 18:57:49,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1809 transitions. [2025-02-05 18:57:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-02-05 18:57:49,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:49,976 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:49,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-02-05 18:57:49,977 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1886173323, now seen corresponding path program 1 times [2025-02-05 18:57:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060909993] [2025-02-05 18:57:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 18:57:50,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 18:57:50,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:50,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060909993] [2025-02-05 18:57:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060909993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230283766] [2025-02-05 18:57:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:50,857 INFO L87 Difference]: Start difference. First operand 1381 states and 1809 transitions. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:51,234 INFO L93 Difference]: Finished difference Result 2234 states and 2952 transitions. [2025-02-05 18:57:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 711 [2025-02-05 18:57:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:51,236 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:51,236 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:51,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:51,238 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1099 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:51,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1857 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3080844865258558) internal successors, (1796), 1373 states have internal predecessors, (1796), 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-05 18:57:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1808 transitions. [2025-02-05 18:57:51,264 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1808 transitions. Word has length 711 [2025-02-05 18:57:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:51,264 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1808 transitions. [2025-02-05 18:57:51,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1808 transitions. [2025-02-05 18:57:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-02-05 18:57:51,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:51,271 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-02-05 18:57:51,271 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1025831790, now seen corresponding path program 1 times [2025-02-05 18:57:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840985732] [2025-02-05 18:57:51,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-02-05 18:57:51,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-02-05 18:57:51,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:51,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840985732] [2025-02-05 18:57:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840985732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736365411] [2025-02-05 18:57:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:52,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:52,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:52,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:52,453 INFO L87 Difference]: Start difference. First operand 1381 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:52,816 INFO L93 Difference]: Finished difference Result 2234 states and 2950 transitions. [2025-02-05 18:57:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 712 [2025-02-05 18:57:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:52,819 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:52,819 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:52,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:52,820 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1995 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:52,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 1850 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3073561544064094) internal successors, (1795), 1373 states have internal predecessors, (1795), 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-05 18:57:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1807 transitions. [2025-02-05 18:57:52,842 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1807 transitions. Word has length 712 [2025-02-05 18:57:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1807 transitions. [2025-02-05 18:57:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1807 transitions. [2025-02-05 18:57:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2025-02-05 18:57:52,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:52,848 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:52,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-02-05 18:57:52,848 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:52,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -9804740, now seen corresponding path program 1 times [2025-02-05 18:57:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008795341] [2025-02-05 18:57:52,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-02-05 18:57:53,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-02-05 18:57:53,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:53,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008795341] [2025-02-05 18:57:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008795341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664593549] [2025-02-05 18:57:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:53,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:53,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:53,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:53,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:53,748 INFO L87 Difference]: Start difference. First operand 1381 states and 1807 transitions. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:54,067 INFO L93 Difference]: Finished difference Result 2234 states and 2948 transitions. [2025-02-05 18:57:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 713 [2025-02-05 18:57:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:54,069 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:54,069 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:54,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:54,070 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1083 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:54,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1857 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.306627822286963) internal successors, (1794), 1373 states have internal predecessors, (1794), 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-05 18:57:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1806 transitions. [2025-02-05 18:57:54,088 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1806 transitions. Word has length 713 [2025-02-05 18:57:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:54,088 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1806 transitions. [2025-02-05 18:57:54,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1806 transitions. [2025-02-05 18:57:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-02-05 18:57:54,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:54,092 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-02-05 18:57:54,093 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 455204195, now seen corresponding path program 1 times [2025-02-05 18:57:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445975752] [2025-02-05 18:57:54,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:54,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-02-05 18:57:54,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-02-05 18:57:54,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:54,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445975752] [2025-02-05 18:57:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445975752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370703792] [2025-02-05 18:57:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:54,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:54,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:54,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:54,980 INFO L87 Difference]: Start difference. First operand 1381 states and 1806 transitions. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:55,332 INFO L93 Difference]: Finished difference Result 2234 states and 2946 transitions. [2025-02-05 18:57:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 714 [2025-02-05 18:57:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:55,334 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:55,334 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:55,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:55,335 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1075 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:55,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1857 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3058994901675165) internal successors, (1793), 1373 states have internal predecessors, (1793), 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-05 18:57:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1805 transitions. [2025-02-05 18:57:55,385 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1805 transitions. Word has length 714 [2025-02-05 18:57:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:55,386 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1805 transitions. [2025-02-05 18:57:55,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1805 transitions. [2025-02-05 18:57:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-02-05 18:57:55,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:55,390 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-02-05 18:57:55,390 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 929146221, now seen corresponding path program 1 times [2025-02-05 18:57:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994889613] [2025-02-05 18:57:55,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:55,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-02-05 18:57:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-02-05 18:57:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:57:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:57:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 18:57:56,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:57:56,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994889613] [2025-02-05 18:57:56,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994889613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:57:56,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:57:56,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:57:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453602722] [2025-02-05 18:57:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:57:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:57:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:57:56,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:57:56,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:57:56,258 INFO L87 Difference]: Start difference. First operand 1381 states and 1805 transitions. Second operand has 5 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:57:56,578 INFO L93 Difference]: Finished difference Result 2234 states and 2944 transitions. [2025-02-05 18:57:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:57:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 715 [2025-02-05 18:57:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:57:56,580 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 18:57:56,580 INFO L226 Difference]: Without dead ends: 1381 [2025-02-05 18:57:56,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:57:56,581 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1947 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:57:56,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 1850 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:57:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-02-05 18:57:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-02-05 18:57:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1373 states have (on average 1.3051711580480698) internal successors, (1792), 1373 states have internal predecessors, (1792), 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-05 18:57:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1804 transitions. [2025-02-05 18:57:56,597 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1804 transitions. Word has length 715 [2025-02-05 18:57:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:57:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1804 transitions. [2025-02-05 18:57:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 18:57:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1804 transitions. [2025-02-05 18:57:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2025-02-05 18:57:56,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:57:56,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:57:56,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-02-05 18:57:56,601 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:57:56,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:57:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -499201100, now seen corresponding path program 1 times [2025-02-05 18:57:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:57:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025065819] [2025-02-05 18:57:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:57:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:57:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes.