./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 32bit --witnessprinter.graph.data.programhash 9c24cf8614122b4c7261c0b63b81d3256f2a3b6068da6913f88528a2638cc015 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:11:17,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:11:17,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:11:17,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:11:17,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:11:17,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:11:17,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:11:17,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:11:17,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:11:17,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:11:17,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:11:17,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:11:17,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:11:17,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:11:17,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:11:17,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:11:17,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:11:17,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:11:17,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:17,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:11:17,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:11:17,771 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/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c24cf8614122b4c7261c0b63b81d3256f2a3b6068da6913f88528a2638cc015 [2025-03-03 20:11:17,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:11:18,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:11:18,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:11:18,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:11:18,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:11:18,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i [2025-03-03 20:11:19,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c867b3eb7/1bd2214d2594454bb5a7d16537b650a2/FLAG0098a4bfa [2025-03-03 20:11:19,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:11:19,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i [2025-03-03 20:11:19,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c867b3eb7/1bd2214d2594454bb5a7d16537b650a2/FLAG0098a4bfa [2025-03-03 20:11:19,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c867b3eb7/1bd2214d2594454bb5a7d16537b650a2 [2025-03-03 20:11:19,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:11:19,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:11:19,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:19,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:11:19,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:11:19,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:19,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a63580c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19, skipping insertion in model container [2025-03-03 20:11:19,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:19,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:11:19,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i[916,929] [2025-03-03 20:11:19,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:19,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:11:19,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-78.i[916,929] [2025-03-03 20:11:19,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:19,987 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:11:19,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19 WrapperNode [2025-03-03 20:11:19,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:19,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:19,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:11:19,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:11:19,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,102 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 860 [2025-03-03 20:11:20,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:20,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:11:20,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:11:20,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:11:20,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,177 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-03-03 20:11:20,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:11:20,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:11:20,263 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:11:20,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:11:20,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (1/1) ... [2025-03-03 20:11:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:20,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:11:20,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:11:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:11:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:11:20,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:11:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:11:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:11:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:11:20,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:11:20,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:11:21,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: havoc property_#t~bitwise80#1;havoc property_#t~short81#1;havoc property_#t~bitwise82#1;havoc property_#t~short83#1; [2025-03-03 20:11:21,486 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 20:11:21,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:11:21,527 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:11:21,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:11:21,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:21 BoogieIcfgContainer [2025-03-03 20:11:21,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:11:21,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:11:21,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:11:21,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:11:21,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:11:19" (1/3) ... [2025-03-03 20:11:21,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:21, skipping insertion in model container [2025-03-03 20:11:21,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:19" (2/3) ... [2025-03-03 20:11:21,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:21, skipping insertion in model container [2025-03-03 20:11:21,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:21" (3/3) ... [2025-03-03 20:11:21,539 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-78.i [2025-03-03 20:11:21,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:11:21,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-78.i that has 2 procedures, 349 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:11:21,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:11:21,615 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;@6f2c8f1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:11:21,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:11:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 20:11:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:21,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:21,648 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:21,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:21,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:21,654 INFO L85 PathProgramCache]: Analyzing trace with hash -922865900, now seen corresponding path program 1 times [2025-03-03 20:11:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646409091] [2025-03-03 20:11:21,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:21,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 20:11:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646409091] [2025-03-03 20:11:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646409091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956599468] [2025-03-03 20:11:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:22,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:11:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:22,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:22,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:11:22,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 20:11:22,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956599468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:11:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231912661] [2025-03-03 20:11:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:11:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:22,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:11:22,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:22,751 INFO L87 Difference]: Start difference. First operand has 349 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 20:11:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:22,846 INFO L93 Difference]: Finished difference Result 684 states and 1253 transitions. [2025-03-03 20:11:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:11:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 622 [2025-03-03 20:11:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:22,859 INFO L225 Difference]: With dead ends: 684 [2025-03-03 20:11:22,859 INFO L226 Difference]: Without dead ends: 338 [2025-03-03 20:11:22,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 623 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-03-03 20:11:22,867 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:22,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-03 20:11:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-03 20:11:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 242 states have internal predecessors, (381), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 20:11:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 569 transitions. [2025-03-03 20:11:22,950 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 569 transitions. Word has length 622 [2025-03-03 20:11:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 569 transitions. [2025-03-03 20:11:22,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 20:11:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 569 transitions. [2025-03-03 20:11:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:22,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:22,973 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:22,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:11:23,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:11:23,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:23,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1847815406, now seen corresponding path program 1 times [2025-03-03 20:11:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683359892] [2025-03-03 20:11:23,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:23,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683359892] [2025-03-03 20:11:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683359892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:23,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528401672] [2025-03-03 20:11:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:23,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:23,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:23,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:23,815 INFO L87 Difference]: Start difference. First operand 338 states and 569 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:23,958 INFO L93 Difference]: Finished difference Result 895 states and 1514 transitions. [2025-03-03 20:11:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:23,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:23,967 INFO L225 Difference]: With dead ends: 895 [2025-03-03 20:11:23,969 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 20:11:23,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:23,971 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 358 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:23,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1053 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 20:11:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 557. [2025-03-03 20:11:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 428 states have (on average 1.5981308411214954) internal successors, (684), 429 states have internal predecessors, (684), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:11:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 936 transitions. [2025-03-03 20:11:24,034 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 936 transitions. Word has length 622 [2025-03-03 20:11:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:24,039 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 936 transitions. [2025-03-03 20:11:24,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 936 transitions. [2025-03-03 20:11:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:24,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:24,051 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:24,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:11:24,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:24,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash -617402638, now seen corresponding path program 1 times [2025-03-03 20:11:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827050995] [2025-03-03 20:11:24,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:24,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:24,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:24,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:24,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827050995] [2025-03-03 20:11:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827050995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126370149] [2025-03-03 20:11:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:24,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:24,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:24,529 INFO L87 Difference]: Start difference. First operand 557 states and 936 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:24,635 INFO L93 Difference]: Finished difference Result 1408 states and 2339 transitions. [2025-03-03 20:11:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:24,643 INFO L225 Difference]: With dead ends: 1408 [2025-03-03 20:11:24,643 INFO L226 Difference]: Without dead ends: 854 [2025-03-03 20:11:24,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:24,645 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 298 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:24,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1318 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-03 20:11:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 851. [2025-03-03 20:11:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 603 states have (on average 1.51575456053068) internal successors, (914), 606 states have internal predecessors, (914), 243 states have call successors, (243), 4 states have call predecessors, (243), 4 states have return successors, (243), 240 states have call predecessors, (243), 243 states have call successors, (243) [2025-03-03 20:11:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1400 transitions. [2025-03-03 20:11:24,714 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1400 transitions. Word has length 622 [2025-03-03 20:11:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:24,715 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1400 transitions. [2025-03-03 20:11:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1400 transitions. [2025-03-03 20:11:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:24,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:24,728 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:24,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:11:24,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:24,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -648422445, now seen corresponding path program 1 times [2025-03-03 20:11:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:24,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957424660] [2025-03-03 20:11:24,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:24,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:24,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:24,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:24,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957424660] [2025-03-03 20:11:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957424660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576118886] [2025-03-03 20:11:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:25,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:25,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:25,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:25,119 INFO L87 Difference]: Start difference. First operand 851 states and 1400 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 2 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 20:11:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:25,286 INFO L93 Difference]: Finished difference Result 2266 states and 3720 transitions. [2025-03-03 20:11:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 2 states have call predecessors, (94), 2 states have call successors, (94) Word has length 622 [2025-03-03 20:11:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:25,299 INFO L225 Difference]: With dead ends: 2266 [2025-03-03 20:11:25,300 INFO L226 Difference]: Without dead ends: 1418 [2025-03-03 20:11:25,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:25,304 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 518 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:25,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1612 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-03-03 20:11:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1416. [2025-03-03 20:11:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 985 states have (on average 1.498477157360406) internal successors, (1476), 989 states have internal predecessors, (1476), 422 states have call successors, (422), 8 states have call predecessors, (422), 8 states have return successors, (422), 418 states have call predecessors, (422), 422 states have call successors, (422) [2025-03-03 20:11:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2320 transitions. [2025-03-03 20:11:25,463 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2320 transitions. Word has length 622 [2025-03-03 20:11:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:25,465 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2320 transitions. [2025-03-03 20:11:25,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 2 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 20:11:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2320 transitions. [2025-03-03 20:11:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:25,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:25,473 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:25,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:11:25,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:25,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1471864754, now seen corresponding path program 1 times [2025-03-03 20:11:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:25,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73395177] [2025-03-03 20:11:25,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:25,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:25,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:25,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:25,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73395177] [2025-03-03 20:11:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73395177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:25,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:25,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518741300] [2025-03-03 20:11:25,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:25,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:25,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:25,830 INFO L87 Difference]: Start difference. First operand 1416 states and 2320 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:26,335 INFO L93 Difference]: Finished difference Result 3703 states and 6041 transitions. [2025-03-03 20:11:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:26,349 INFO L225 Difference]: With dead ends: 3703 [2025-03-03 20:11:26,349 INFO L226 Difference]: Without dead ends: 2290 [2025-03-03 20:11:26,353 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-03-03 20:11:26,354 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 811 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:26,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1378 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:11:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-03 20:11:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2281. [2025-03-03 20:11:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 1647 states have (on average 1.5088038858530661) internal successors, (2485), 1658 states have internal predecessors, (2485), 614 states have call successors, (614), 19 states have call predecessors, (614), 19 states have return successors, (614), 603 states have call predecessors, (614), 614 states have call successors, (614) [2025-03-03 20:11:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3713 transitions. [2025-03-03 20:11:26,499 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3713 transitions. Word has length 622 [2025-03-03 20:11:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:26,500 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3713 transitions. [2025-03-03 20:11:26,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3713 transitions. [2025-03-03 20:11:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:26,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:26,506 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:11:26,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:26,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash -228875725, now seen corresponding path program 1 times [2025-03-03 20:11:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:26,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212265367] [2025-03-03 20:11:26,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:26,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:26,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:26,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:26,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212265367] [2025-03-03 20:11:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212265367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925937235] [2025-03-03 20:11:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:26,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:26,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:26,937 INFO L87 Difference]: Start difference. First operand 2281 states and 3713 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:27,576 INFO L93 Difference]: Finished difference Result 8407 states and 13699 transitions. [2025-03-03 20:11:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:27,615 INFO L225 Difference]: With dead ends: 8407 [2025-03-03 20:11:27,615 INFO L226 Difference]: Without dead ends: 6191 [2025-03-03 20:11:27,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:27,623 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 683 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:27,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1661 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:11:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-03-03 20:11:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 4831. [2025-03-03 20:11:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4831 states, 3638 states have (on average 1.5464540956569544) internal successors, (5626), 3658 states have internal predecessors, (5626), 1156 states have call successors, (1156), 36 states have call predecessors, (1156), 36 states have return successors, (1156), 1136 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-03 20:11:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 7938 transitions. [2025-03-03 20:11:28,040 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 7938 transitions. Word has length 622 [2025-03-03 20:11:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:28,042 INFO L471 AbstractCegarLoop]: Abstraction has 4831 states and 7938 transitions. [2025-03-03 20:11:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 7938 transitions. [2025-03-03 20:11:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:28,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:28,049 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:28,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:11:28,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 100890036, now seen corresponding path program 1 times [2025-03-03 20:11:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324673659] [2025-03-03 20:11:28,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324673659] [2025-03-03 20:11:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324673659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881304784] [2025-03-03 20:11:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:28,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:28,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:28,435 INFO L87 Difference]: Start difference. First operand 4831 states and 7938 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:29,555 INFO L93 Difference]: Finished difference Result 17879 states and 29220 transitions. [2025-03-03 20:11:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:29,623 INFO L225 Difference]: With dead ends: 17879 [2025-03-03 20:11:29,624 INFO L226 Difference]: Without dead ends: 13051 [2025-03-03 20:11:29,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:29,640 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1131 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:29,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2116 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:11:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2025-03-03 20:11:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 13039. [2025-03-03 20:11:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13039 states, 9658 states have (on average 1.5240215365500103) internal successors, (14719), 9722 states have internal predecessors, (14719), 3272 states have call successors, (3272), 108 states have call predecessors, (3272), 108 states have return successors, (3272), 3208 states have call predecessors, (3272), 3272 states have call successors, (3272) [2025-03-03 20:11:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13039 states to 13039 states and 21263 transitions. [2025-03-03 20:11:30,477 INFO L78 Accepts]: Start accepts. Automaton has 13039 states and 21263 transitions. Word has length 622 [2025-03-03 20:11:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 13039 states and 21263 transitions. [2025-03-03 20:11:30,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13039 states and 21263 transitions. [2025-03-03 20:11:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:11:30,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:30,494 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:30,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:11:30,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2051190291, now seen corresponding path program 1 times [2025-03-03 20:11:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524760017] [2025-03-03 20:11:30,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:11:30,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:11:30,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:30,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524760017] [2025-03-03 20:11:30,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524760017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:30,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177984628] [2025-03-03 20:11:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:30,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:30,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:30,761 INFO L87 Difference]: Start difference. First operand 13039 states and 21263 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:31,193 INFO L93 Difference]: Finished difference Result 26075 states and 42523 transitions. [2025-03-03 20:11:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 622 [2025-03-03 20:11:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:31,269 INFO L225 Difference]: With dead ends: 26075 [2025-03-03 20:11:31,270 INFO L226 Difference]: Without dead ends: 13039 [2025-03-03 20:11:31,309 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-03-03 20:11:31,309 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:31,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13039 states. [2025-03-03 20:11:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13039 to 13039. [2025-03-03 20:11:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13039 states, 9658 states have (on average 1.5165665769310417) internal successors, (14647), 9722 states have internal predecessors, (14647), 3272 states have call successors, (3272), 108 states have call predecessors, (3272), 108 states have return successors, (3272), 3208 states have call predecessors, (3272), 3272 states have call successors, (3272) [2025-03-03 20:11:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13039 states to 13039 states and 21191 transitions. [2025-03-03 20:11:32,003 INFO L78 Accepts]: Start accepts. Automaton has 13039 states and 21191 transitions. Word has length 622 [2025-03-03 20:11:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 13039 states and 21191 transitions. [2025-03-03 20:11:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13039 states and 21191 transitions. [2025-03-03 20:11:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 20:11:32,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:32,020 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:11:32,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 557780986, now seen corresponding path program 1 times [2025-03-03 20:11:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973337648] [2025-03-03 20:11:32,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:32,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 20:11:32,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 20:11:32,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:32,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973337648] [2025-03-03 20:11:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973337648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438125735] [2025-03-03 20:11:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:32,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:32,368 INFO L87 Difference]: Start difference. First operand 13039 states and 21191 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:34,161 INFO L93 Difference]: Finished difference Result 47462 states and 76855 transitions. [2025-03-03 20:11:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 623 [2025-03-03 20:11:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:34,433 INFO L225 Difference]: With dead ends: 47462 [2025-03-03 20:11:34,433 INFO L226 Difference]: Without dead ends: 34426 [2025-03-03 20:11:34,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:34,470 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 1539 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:34,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 2101 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:11:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34426 states. [2025-03-03 20:11:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34426 to 13933. [2025-03-03 20:11:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13933 states, 10552 states have (on average 1.5323161485974224) internal successors, (16169), 10616 states have internal predecessors, (16169), 3272 states have call successors, (3272), 108 states have call predecessors, (3272), 108 states have return successors, (3272), 3208 states have call predecessors, (3272), 3272 states have call successors, (3272) [2025-03-03 20:11:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13933 states to 13933 states and 22713 transitions. [2025-03-03 20:11:35,410 INFO L78 Accepts]: Start accepts. Automaton has 13933 states and 22713 transitions. Word has length 623 [2025-03-03 20:11:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:35,411 INFO L471 AbstractCegarLoop]: Abstraction has 13933 states and 22713 transitions. [2025-03-03 20:11:35,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13933 states and 22713 transitions. [2025-03-03 20:11:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 20:11:35,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:35,424 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:35,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:11:35,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1690971579, now seen corresponding path program 1 times [2025-03-03 20:11:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786915820] [2025-03-03 20:11:35,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:35,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 20:11:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 20:11:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:35,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:35,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786915820] [2025-03-03 20:11:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786915820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000590006] [2025-03-03 20:11:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:35,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:35,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:35,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:35,801 INFO L87 Difference]: Start difference. First operand 13933 states and 22713 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:37,205 INFO L93 Difference]: Finished difference Result 41793 states and 68133 transitions. [2025-03-03 20:11:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 623 [2025-03-03 20:11:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:37,333 INFO L225 Difference]: With dead ends: 41793 [2025-03-03 20:11:37,334 INFO L226 Difference]: Without dead ends: 27863 [2025-03-03 20:11:37,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:37,378 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 368 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1095 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27863 states. [2025-03-03 20:11:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27863 to 27861. [2025-03-03 20:11:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27861 states, 21100 states have (on average 1.5301421800947868) internal successors, (32286), 21228 states have internal predecessors, (32286), 6544 states have call successors, (6544), 216 states have call predecessors, (6544), 216 states have return successors, (6544), 6416 states have call predecessors, (6544), 6544 states have call successors, (6544) [2025-03-03 20:11:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27861 states to 27861 states and 45374 transitions. [2025-03-03 20:11:39,091 INFO L78 Accepts]: Start accepts. Automaton has 27861 states and 45374 transitions. Word has length 623 [2025-03-03 20:11:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:39,092 INFO L471 AbstractCegarLoop]: Abstraction has 27861 states and 45374 transitions. [2025-03-03 20:11:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27861 states and 45374 transitions. [2025-03-03 20:11:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 20:11:39,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:39,116 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:39,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:11:39,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:39,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1683212220, now seen corresponding path program 1 times [2025-03-03 20:11:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:39,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830761092] [2025-03-03 20:11:39,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:39,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 20:11:39,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 20:11:39,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:39,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830761092] [2025-03-03 20:11:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830761092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804486769] [2025-03-03 20:11:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:39,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:39,477 INFO L87 Difference]: Start difference. First operand 27861 states and 45374 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:40,796 INFO L93 Difference]: Finished difference Result 68281 states and 111522 transitions. [2025-03-03 20:11:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:40,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 623 [2025-03-03 20:11:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:40,955 INFO L225 Difference]: With dead ends: 68281 [2025-03-03 20:11:40,956 INFO L226 Difference]: Without dead ends: 40423 [2025-03-03 20:11:41,025 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-03-03 20:11:41,025 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 580 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:41,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1615 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40423 states. [2025-03-03 20:11:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40423 to 38261. [2025-03-03 20:11:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38261 states, 31402 states have (on average 1.578307114196548) internal successors, (49562), 31530 states have internal predecessors, (49562), 6638 states have call successors, (6638), 220 states have call predecessors, (6638), 220 states have return successors, (6638), 6510 states have call predecessors, (6638), 6638 states have call successors, (6638) [2025-03-03 20:11:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38261 states to 38261 states and 62838 transitions. [2025-03-03 20:11:43,194 INFO L78 Accepts]: Start accepts. Automaton has 38261 states and 62838 transitions. Word has length 623 [2025-03-03 20:11:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 38261 states and 62838 transitions. [2025-03-03 20:11:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 38261 states and 62838 transitions. [2025-03-03 20:11:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-03-03 20:11:43,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:43,218 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:11:43,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 288726040, now seen corresponding path program 1 times [2025-03-03 20:11:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703935752] [2025-03-03 20:11:43,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:43,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-03 20:11:43,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-03 20:11:43,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:43,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703935752] [2025-03-03 20:11:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703935752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411985912] [2025-03-03 20:11:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:43,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:43,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:43,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:43,662 INFO L87 Difference]: Start difference. First operand 38261 states and 62838 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:46,274 INFO L93 Difference]: Finished difference Result 99163 states and 161213 transitions. [2025-03-03 20:11:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:46,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 624 [2025-03-03 20:11:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:46,499 INFO L225 Difference]: With dead ends: 99163 [2025-03-03 20:11:46,499 INFO L226 Difference]: Without dead ends: 69145 [2025-03-03 20:11:46,594 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-03-03 20:11:46,595 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 618 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:46,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1641 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69145 states. [2025-03-03 20:11:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69145 to 67125. [2025-03-03 20:11:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67125 states, 53506 states have (on average 1.5484618547452622) internal successors, (82852), 53762 states have internal predecessors, (82852), 13182 states have call successors, (13182), 436 states have call predecessors, (13182), 436 states have return successors, (13182), 12926 states have call predecessors, (13182), 13182 states have call successors, (13182) [2025-03-03 20:11:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67125 states to 67125 states and 109216 transitions. [2025-03-03 20:11:50,625 INFO L78 Accepts]: Start accepts. Automaton has 67125 states and 109216 transitions. Word has length 624 [2025-03-03 20:11:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:50,626 INFO L471 AbstractCegarLoop]: Abstraction has 67125 states and 109216 transitions. [2025-03-03 20:11:50,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67125 states and 109216 transitions. [2025-03-03 20:11:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-03 20:11:50,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:50,649 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:11:50,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash 701198809, now seen corresponding path program 1 times [2025-03-03 20:11:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44991131] [2025-03-03 20:11:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:50,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-03 20:11:50,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-03 20:11:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 20:11:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44991131] [2025-03-03 20:11:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44991131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:51,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:11:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950802838] [2025-03-03 20:11:51,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:51,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:11:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:51,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:11:51,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:51,258 INFO L87 Difference]: Start difference. First operand 67125 states and 109216 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 20:11:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:56,087 INFO L93 Difference]: Finished difference Result 191949 states and 308988 transitions. [2025-03-03 20:11:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:11:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 625 [2025-03-03 20:11:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:56,467 INFO L225 Difference]: With dead ends: 191949 [2025-03-03 20:11:56,467 INFO L226 Difference]: Without dead ends: 134651 [2025-03-03 20:11:56,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:11:56,614 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1220 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:56,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 3728 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:11:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134651 states.