./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-250_file-18.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 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:55:47,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:55:47,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:55:47,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:55:47,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:55:47,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:55:47,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:55:47,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:55:47,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:55:47,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:55:47,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:55:47,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:55:47,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:55:47,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:55:47,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:55:47,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:55:47,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:55:47,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:55:47,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:55:47,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:55:47,100 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 -> 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 [2025-03-08 10:55:47,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:55:47,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:55:47,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:55:47,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:55:47,366 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:55:47,367 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-250_file-18.i [2025-03-08 10:55:48,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e97b949e/cf3d93f6972541cc8bad9593a04bb960/FLAGc5350336c [2025-03-08 10:55:48,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:55:48,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-03-08 10:55:48,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e97b949e/cf3d93f6972541cc8bad9593a04bb960/FLAGc5350336c [2025-03-08 10:55:49,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e97b949e/cf3d93f6972541cc8bad9593a04bb960 [2025-03-08 10:55:49,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:55:49,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:55:49,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:55:49,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:55:49,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:55:49,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49, skipping insertion in model container [2025-03-08 10:55:49,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:55:49,239 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-250_file-18.i[916,929] [2025-03-08 10:55:49,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:55:49,389 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:55:49,401 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-250_file-18.i[916,929] [2025-03-08 10:55:49,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:55:49,461 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:55:49,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49 WrapperNode [2025-03-08 10:55:49,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:55:49,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:55:49,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:55:49,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:55:49,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,519 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2025-03-08 10:55:49,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:55:49,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:55:49,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:55:49,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:55:49,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,547 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-08 10:55:49,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:55:49,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:55:49,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:55:49,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:55:49,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (1/1) ... [2025-03-08 10:55:49,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:55:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:49,630 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-08 10:55:49,636 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-08 10:55:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:55:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:55:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:55:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:55:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:55:49,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:55:49,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:55:49,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:55:50,455 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 10:55:50,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:55:50,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:55:50,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:55:50,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:50 BoogieIcfgContainer [2025-03-08 10:55:50,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:55:50,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:55:50,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:55:50,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:55:50,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:55:49" (1/3) ... [2025-03-08 10:55:50,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bff498d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:50, skipping insertion in model container [2025-03-08 10:55:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:49" (2/3) ... [2025-03-08 10:55:50,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bff498d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:50, skipping insertion in model container [2025-03-08 10:55:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:50" (3/3) ... [2025-03-08 10:55:50,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-03-08 10:55:50,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:55:50,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:55:50,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:55:50,597 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;@8fd1d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:55:50,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:55:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 10:55:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:50,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:50,629 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:50,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:50,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1550701607, now seen corresponding path program 1 times [2025-03-08 10:55:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560886504] [2025-03-08 10:55:50,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:50,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:50,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:50,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:50,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-08 10:55:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560886504] [2025-03-08 10:55:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560886504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982870080] [2025-03-08 10:55:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:51,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:51,109 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-08 10:55:51,110 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-08 10:55:51,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:51,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:51,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:55:51,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-08 10:55:51,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:55:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982870080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:51,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:55:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:55:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050555526] [2025-03-08 10:55:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:55:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:55:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:55:51,479 INFO L87 Difference]: Start difference. First operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:55:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:51,529 INFO L93 Difference]: Finished difference Result 474 states and 875 transitions. [2025-03-08 10:55:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:55:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-03-08 10:55:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:51,536 INFO L225 Difference]: With dead ends: 474 [2025-03-08 10:55:51,536 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 10:55:51,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 519 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-08 10:55:51,543 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:51,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 10:55:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-08 10:55:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 153 states have internal predecessors, (228), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 10:55:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 392 transitions. [2025-03-08 10:55:51,607 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 392 transitions. Word has length 518 [2025-03-08 10:55:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:51,607 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 392 transitions. [2025-03-08 10:55:51,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:55:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 392 transitions. [2025-03-08 10:55:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:51,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:51,619 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:51,627 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-08 10:55:51,819 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-08 10:55:51,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 288418745, now seen corresponding path program 1 times [2025-03-08 10:55:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743181830] [2025-03-08 10:55:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:51,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:51,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743181830] [2025-03-08 10:55:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743181830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128506909] [2025-03-08 10:55:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:52,279 INFO L87 Difference]: Start difference. First operand 237 states and 392 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:52,386 INFO L93 Difference]: Finished difference Result 704 states and 1168 transitions. [2025-03-08 10:55:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:52,395 INFO L225 Difference]: With dead ends: 704 [2025-03-08 10:55:52,395 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 10:55:52,397 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-08 10:55:52,397 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 376 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:52,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 747 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:55:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 10:55:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2025-03-08 10:55:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 301 states have (on average 1.478405315614618) internal successors, (445), 301 states have internal predecessors, (445), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 10:55:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 773 transitions. [2025-03-08 10:55:52,468 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 773 transitions. Word has length 518 [2025-03-08 10:55:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:52,470 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 773 transitions. [2025-03-08 10:55:52,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 773 transitions. [2025-03-08 10:55:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:52,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:52,477 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:52,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:55:52,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1405462729, now seen corresponding path program 1 times [2025-03-08 10:55:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151762696] [2025-03-08 10:55:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:52,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:52,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:52,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151762696] [2025-03-08 10:55:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151762696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500190325] [2025-03-08 10:55:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:52,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:52,737 INFO L87 Difference]: Start difference. First operand 468 states and 773 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:52,810 INFO L93 Difference]: Finished difference Result 1181 states and 1954 transitions. [2025-03-08 10:55:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:52,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:52,815 INFO L225 Difference]: With dead ends: 1181 [2025-03-08 10:55:52,815 INFO L226 Difference]: Without dead ends: 716 [2025-03-08 10:55:52,817 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-08 10:55:52,817 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 184 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:52,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 747 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-08 10:55:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 712. [2025-03-08 10:55:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 509 states have (on average 1.5343811394891944) internal successors, (781), 511 states have internal predecessors, (781), 198 states have call successors, (198), 4 states have call predecessors, (198), 4 states have return successors, (198), 196 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-08 10:55:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1177 transitions. [2025-03-08 10:55:52,875 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1177 transitions. Word has length 518 [2025-03-08 10:55:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1177 transitions. [2025-03-08 10:55:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1177 transitions. [2025-03-08 10:55:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:52,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:52,883 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:52,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:55:52,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1374442922, now seen corresponding path program 1 times [2025-03-08 10:55:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911424034] [2025-03-08 10:55:52,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:52,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:52,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:52,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:52,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911424034] [2025-03-08 10:55:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911424034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:53,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369953950] [2025-03-08 10:55:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:53,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:53,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:53,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:53,202 INFO L87 Difference]: Start difference. First operand 712 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:53,294 INFO L93 Difference]: Finished difference Result 1919 states and 3176 transitions. [2025-03-08 10:55:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:53,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:53,303 INFO L225 Difference]: With dead ends: 1919 [2025-03-08 10:55:53,303 INFO L226 Difference]: Without dead ends: 1210 [2025-03-08 10:55:53,306 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-08 10:55:53,306 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 222 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:53,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 864 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-08 10:55:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1206. [2025-03-08 10:55:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 915 states have (on average 1.5595628415300546) internal successors, (1427), 921 states have internal predecessors, (1427), 282 states have call successors, (282), 8 states have call predecessors, (282), 8 states have return successors, (282), 276 states have call predecessors, (282), 282 states have call successors, (282) [2025-03-08 10:55:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1991 transitions. [2025-03-08 10:55:53,405 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1991 transitions. Word has length 518 [2025-03-08 10:55:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1991 transitions. [2025-03-08 10:55:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1991 transitions. [2025-03-08 10:55:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:53,416 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:55:53,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash -605272907, now seen corresponding path program 1 times [2025-03-08 10:55:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553065663] [2025-03-08 10:55:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:53,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:53,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:53,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:53,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553065663] [2025-03-08 10:55:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553065663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:55:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530325577] [2025-03-08 10:55:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:55:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:53,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:55:53,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:53,728 INFO L87 Difference]: Start difference. First operand 1206 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:54,466 INFO L93 Difference]: Finished difference Result 4137 states and 6785 transitions. [2025-03-08 10:55:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:55:54,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:54,482 INFO L225 Difference]: With dead ends: 4137 [2025-03-08 10:55:54,483 INFO L226 Difference]: Without dead ends: 2934 [2025-03-08 10:55:54,487 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-08 10:55:54,488 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 514 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:54,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1080 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:55:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2025-03-08 10:55:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2294. [2025-03-08 10:55:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 1759 states have (on average 1.5616827743035815) internal successors, (2747), 1773 states have internal predecessors, (2747), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-03-08 10:55:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3783 transitions. [2025-03-08 10:55:54,650 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3783 transitions. Word has length 518 [2025-03-08 10:55:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:54,651 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3783 transitions. [2025-03-08 10:55:54,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3783 transitions. [2025-03-08 10:55:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:54,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:54,659 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:55:54,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 748036790, now seen corresponding path program 1 times [2025-03-08 10:55:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672090489] [2025-03-08 10:55:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:54,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672090489] [2025-03-08 10:55:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672090489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538825426] [2025-03-08 10:55:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:54,891 INFO L87 Difference]: Start difference. First operand 2294 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:55,087 INFO L93 Difference]: Finished difference Result 5665 states and 9316 transitions. [2025-03-08 10:55:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:55,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:55,110 INFO L225 Difference]: With dead ends: 5665 [2025-03-08 10:55:55,110 INFO L226 Difference]: Without dead ends: 3374 [2025-03-08 10:55:55,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 10:55:55,118 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 386 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:55,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1051 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2025-03-08 10:55:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2179. [2025-03-08 10:55:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1582 states have (on average 1.5183312262958282) internal successors, (2402), 1597 states have internal predecessors, (2402), 577 states have call successors, (577), 19 states have call predecessors, (577), 19 states have return successors, (577), 562 states have call predecessors, (577), 577 states have call successors, (577) [2025-03-08 10:55:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3556 transitions. [2025-03-08 10:55:55,296 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3556 transitions. Word has length 518 [2025-03-08 10:55:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:55,298 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 3556 transitions. [2025-03-08 10:55:55,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3556 transitions. [2025-03-08 10:55:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:55,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:55,304 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:55:55,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -254472970, now seen corresponding path program 1 times [2025-03-08 10:55:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16322332] [2025-03-08 10:55:55,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:55,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:55,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:55,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:55,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16322332] [2025-03-08 10:55:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16322332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:55,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:55:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672539466] [2025-03-08 10:55:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:55,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:55:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:55:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:55:55,669 INFO L87 Difference]: Start difference. First operand 2179 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:55:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:57,323 INFO L93 Difference]: Finished difference Result 10967 states and 17731 transitions. [2025-03-08 10:55:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:55:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-03-08 10:55:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:57,372 INFO L225 Difference]: With dead ends: 10967 [2025-03-08 10:55:57,372 INFO L226 Difference]: Without dead ends: 8900 [2025-03-08 10:55:57,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:55:57,383 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1173 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:57,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 2451 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:55:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8900 states. [2025-03-08 10:55:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8900 to 4990. [2025-03-08 10:55:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3683 states have (on average 1.5329894108064077) internal successors, (5646), 3716 states have internal predecessors, (5646), 1263 states have call successors, (1263), 43 states have call predecessors, (1263), 43 states have return successors, (1263), 1230 states have call predecessors, (1263), 1263 states have call successors, (1263) [2025-03-08 10:55:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 8172 transitions. [2025-03-08 10:55:57,835 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 8172 transitions. Word has length 518 [2025-03-08 10:55:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:57,836 INFO L471 AbstractCegarLoop]: Abstraction has 4990 states and 8172 transitions. [2025-03-08 10:55:57,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:55:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 8172 transitions. [2025-03-08 10:55:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:57,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:57,842 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:55:57,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1098836727, now seen corresponding path program 1 times [2025-03-08 10:55:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733492782] [2025-03-08 10:55:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:57,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:57,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:57,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:57,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733492782] [2025-03-08 10:55:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733492782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:55:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838647465] [2025-03-08 10:55:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:55:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:58,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:55:58,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:58,162 INFO L87 Difference]: Start difference. First operand 4990 states and 8172 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:58,645 INFO L93 Difference]: Finished difference Result 14746 states and 24180 transitions. [2025-03-08 10:55:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:55:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:58,706 INFO L225 Difference]: With dead ends: 14746 [2025-03-08 10:55:58,707 INFO L226 Difference]: Without dead ends: 9868 [2025-03-08 10:55:58,723 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-08 10:55:58,723 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 247 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:58,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:55:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9868 states. [2025-03-08 10:55:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9868 to 9866. [2025-03-08 10:55:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9866 states, 7315 states have (on average 1.5312371838687628) internal successors, (11201), 7380 states have internal predecessors, (11201), 2467 states have call successors, (2467), 83 states have call predecessors, (2467), 83 states have return successors, (2467), 2402 states have call predecessors, (2467), 2467 states have call successors, (2467) [2025-03-08 10:55:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 16135 transitions. [2025-03-08 10:55:59,452 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 16135 transitions. Word has length 518 [2025-03-08 10:55:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:59,454 INFO L471 AbstractCegarLoop]: Abstraction has 9866 states and 16135 transitions. [2025-03-08 10:55:59,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:55:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 16135 transitions. [2025-03-08 10:55:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:55:59,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:59,465 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:55:59,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:55:59,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:59,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1262067051, now seen corresponding path program 1 times [2025-03-08 10:55:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478425072] [2025-03-08 10:55:59,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:59,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:59,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:55:59,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:55:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:55:59,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:59,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478425072] [2025-03-08 10:55:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478425072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:55:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367778467] [2025-03-08 10:55:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:59,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:55:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:59,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:55:59,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:55:59,874 INFO L87 Difference]: Start difference. First operand 9866 states and 16135 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:01,931 INFO L93 Difference]: Finished difference Result 27578 states and 45043 transitions. [2025-03-08 10:56:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:56:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-03-08 10:56:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:02,016 INFO L225 Difference]: With dead ends: 27578 [2025-03-08 10:56:02,016 INFO L226 Difference]: Without dead ends: 17824 [2025-03-08 10:56:02,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:56:02,055 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1411 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:02,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 2063 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:56:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17824 states. [2025-03-08 10:56:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17824 to 16810. [2025-03-08 10:56:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16810 states, 12591 states have (on average 1.5316495909776824) internal successors, (19285), 12720 states have internal predecessors, (19285), 4067 states have call successors, (4067), 151 states have call predecessors, (4067), 151 states have return successors, (4067), 3938 states have call predecessors, (4067), 4067 states have call successors, (4067) [2025-03-08 10:56:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16810 states to 16810 states and 27419 transitions. [2025-03-08 10:56:02,995 INFO L78 Accepts]: Start accepts. Automaton has 16810 states and 27419 transitions. Word has length 518 [2025-03-08 10:56:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:02,996 INFO L471 AbstractCegarLoop]: Abstraction has 16810 states and 27419 transitions. [2025-03-08 10:56:02,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16810 states and 27419 transitions. [2025-03-08 10:56:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:56:03,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:03,007 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:03,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:56:03,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:03,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1439050419, now seen corresponding path program 1 times [2025-03-08 10:56:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270309865] [2025-03-08 10:56:03,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:56:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:56:03,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:03,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:03,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270309865] [2025-03-08 10:56:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270309865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52207732] [2025-03-08 10:56:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:03,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:03,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:03,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:03,206 INFO L87 Difference]: Start difference. First operand 16810 states and 27419 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:03,869 INFO L93 Difference]: Finished difference Result 30674 states and 49801 transitions. [2025-03-08 10:56:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:03,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:56:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:03,929 INFO L225 Difference]: With dead ends: 30674 [2025-03-08 10:56:03,930 INFO L226 Difference]: Without dead ends: 13976 [2025-03-08 10:56:03,958 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-08 10:56:03,959 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 203 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:03,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 846 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13976 states. [2025-03-08 10:56:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13976 to 11542. [2025-03-08 10:56:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 8411 states have (on average 1.5012483652360005) internal successors, (12627), 8476 states have internal predecessors, (12627), 2979 states have call successors, (2979), 151 states have call predecessors, (2979), 151 states have return successors, (2979), 2914 states have call predecessors, (2979), 2979 states have call successors, (2979) [2025-03-08 10:56:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 18585 transitions. [2025-03-08 10:56:04,664 INFO L78 Accepts]: Start accepts. Automaton has 11542 states and 18585 transitions. Word has length 518 [2025-03-08 10:56:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 11542 states and 18585 transitions. [2025-03-08 10:56:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 11542 states and 18585 transitions. [2025-03-08 10:56:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:56:04,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:04,675 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:56:04,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -915997227, now seen corresponding path program 1 times [2025-03-08 10:56:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608364598] [2025-03-08 10:56:04,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:04,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:56:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:56:04,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:04,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608364598] [2025-03-08 10:56:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608364598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:56:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978750249] [2025-03-08 10:56:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:56:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:56:04,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:56:04,996 INFO L87 Difference]: Start difference. First operand 11542 states and 18585 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:06,498 INFO L93 Difference]: Finished difference Result 31930 states and 51345 transitions. [2025-03-08 10:56:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:56:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-03-08 10:56:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:06,583 INFO L225 Difference]: With dead ends: 31930 [2025-03-08 10:56:06,583 INFO L226 Difference]: Without dead ends: 20500 [2025-03-08 10:56:06,614 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-08 10:56:06,615 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 230 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:06,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1029 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:56:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20500 states. [2025-03-08 10:56:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20500 to 20498. [2025-03-08 10:56:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20498 states, 14655 states have (on average 1.4745138178096213) internal successors, (21609), 14776 states have internal predecessors, (21609), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-03-08 10:56:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20498 states to 20498 states and 32735 transitions. [2025-03-08 10:56:07,763 INFO L78 Accepts]: Start accepts. Automaton has 20498 states and 32735 transitions. Word has length 518 [2025-03-08 10:56:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:07,764 INFO L471 AbstractCegarLoop]: Abstraction has 20498 states and 32735 transitions. [2025-03-08 10:56:07,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20498 states and 32735 transitions. [2025-03-08 10:56:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:56:07,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:07,772 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:07,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:56:07,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:07,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1034303028, now seen corresponding path program 1 times [2025-03-08 10:56:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485677103] [2025-03-08 10:56:07,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:56:07,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:56:07,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485677103] [2025-03-08 10:56:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485677103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:08,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:56:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727378912] [2025-03-08 10:56:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:56:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:08,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:56:08,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:56:08,098 INFO L87 Difference]: Start difference. First operand 20498 states and 32735 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:10,007 INFO L93 Difference]: Finished difference Result 52858 states and 84017 transitions. [2025-03-08 10:56:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:56:10,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-03-08 10:56:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:10,137 INFO L225 Difference]: With dead ends: 52858 [2025-03-08 10:56:10,137 INFO L226 Difference]: Without dead ends: 32472 [2025-03-08 10:56:10,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:56:10,184 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 713 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:10,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2051 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:56:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2025-03-08 10:56:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 21650. [2025-03-08 10:56:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21650 states, 15807 states have (on average 1.484468906180806) internal successors, (23465), 15928 states have internal predecessors, (23465), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-03-08 10:56:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21650 states to 21650 states and 34591 transitions. [2025-03-08 10:56:11,906 INFO L78 Accepts]: Start accepts. Automaton has 21650 states and 34591 transitions. Word has length 518 [2025-03-08 10:56:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:11,907 INFO L471 AbstractCegarLoop]: Abstraction has 21650 states and 34591 transitions. [2025-03-08 10:56:11,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21650 states and 34591 transitions. [2025-03-08 10:56:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-08 10:56:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:11,918 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:56:11,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1907354571, now seen corresponding path program 1 times [2025-03-08 10:56:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365694612] [2025-03-08 10:56:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:11,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-08 10:56:11,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-08 10:56:11,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365694612] [2025-03-08 10:56:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365694612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:56:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970944765] [2025-03-08 10:56:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:56:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:12,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:56:12,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:56:12,398 INFO L87 Difference]: Start difference. First operand 21650 states and 34591 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:14,629 INFO L93 Difference]: Finished difference Result 52778 states and 84011 transitions. [2025-03-08 10:56:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:56:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-03-08 10:56:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:14,762 INFO L225 Difference]: With dead ends: 52778 [2025-03-08 10:56:14,763 INFO L226 Difference]: Without dead ends: 31240 [2025-03-08 10:56:14,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:56:14,820 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1069 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:14,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1979 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:56:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31240 states. [2025-03-08 10:56:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31240 to 21074. [2025-03-08 10:56:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21074 states, 15231 states have (on average 1.4791543562471277) internal successors, (22529), 15352 states have internal predecessors, (22529), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-03-08 10:56:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 33655 transitions. [2025-03-08 10:56:16,251 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 33655 transitions. Word has length 518 [2025-03-08 10:56:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:16,252 INFO L471 AbstractCegarLoop]: Abstraction has 21074 states and 33655 transitions. [2025-03-08 10:56:16,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 33655 transitions. [2025-03-08 10:56:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:56:16,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:16,262 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:56:16,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1129501724, now seen corresponding path program 1 times [2025-03-08 10:56:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295728320] [2025-03-08 10:56:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:56:16,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:56:16,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:16,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:16,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:16,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295728320] [2025-03-08 10:56:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295728320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:16,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:56:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209023515] [2025-03-08 10:56:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:16,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:56:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:16,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:56:16,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:56:16,629 INFO L87 Difference]: Start difference. First operand 21074 states and 33655 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:19,882 INFO L93 Difference]: Finished difference Result 58830 states and 93663 transitions. [2025-03-08 10:56:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:56:19,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-03-08 10:56:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:20,050 INFO L225 Difference]: With dead ends: 58830 [2025-03-08 10:56:20,050 INFO L226 Difference]: Without dead ends: 47400 [2025-03-08 10:56:20,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:56:20,087 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 862 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:20,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1176 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:56:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47400 states. [2025-03-08 10:56:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47400 to 25050. [2025-03-08 10:56:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25050 states, 18495 states have (on average 1.4979724249797242) internal successors, (27705), 18632 states have internal predecessors, (27705), 6235 states have call successors, (6235), 319 states have call predecessors, (6235), 319 states have return successors, (6235), 6098 states have call predecessors, (6235), 6235 states have call successors, (6235) [2025-03-08 10:56:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25050 states to 25050 states and 40175 transitions. [2025-03-08 10:56:22,372 INFO L78 Accepts]: Start accepts. Automaton has 25050 states and 40175 transitions. Word has length 519 [2025-03-08 10:56:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:22,372 INFO L471 AbstractCegarLoop]: Abstraction has 25050 states and 40175 transitions. [2025-03-08 10:56:22,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25050 states and 40175 transitions. [2025-03-08 10:56:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:56:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:22,383 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:56:22,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash 223807973, now seen corresponding path program 1 times [2025-03-08 10:56:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264571524] [2025-03-08 10:56:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:22,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:56:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:56:22,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:22,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264571524] [2025-03-08 10:56:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264571524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:22,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:56:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025179103] [2025-03-08 10:56:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:22,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:56:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:22,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:56:22,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:56:22,799 INFO L87 Difference]: Start difference. First operand 25050 states and 40175 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:25,596 INFO L93 Difference]: Finished difference Result 53388 states and 85708 transitions. [2025-03-08 10:56:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:56:25,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-03-08 10:56:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:25,753 INFO L225 Difference]: With dead ends: 53388 [2025-03-08 10:56:25,754 INFO L226 Difference]: Without dead ends: 39662 [2025-03-08 10:56:25,802 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-08 10:56:25,803 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 536 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:25,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1598 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:56:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2025-03-08 10:56:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 33342. [2025-03-08 10:56:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33342 states, 24075 states have (on average 1.48398753894081) internal successors, (35727), 24268 states have internal predecessors, (35727), 8819 states have call successors, (8819), 447 states have call predecessors, (8819), 447 states have return successors, (8819), 8626 states have call predecessors, (8819), 8819 states have call successors, (8819) [2025-03-08 10:56:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33342 states to 33342 states and 53365 transitions. [2025-03-08 10:56:28,268 INFO L78 Accepts]: Start accepts. Automaton has 33342 states and 53365 transitions. Word has length 519 [2025-03-08 10:56:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:28,269 INFO L471 AbstractCegarLoop]: Abstraction has 33342 states and 53365 transitions. [2025-03-08 10:56:28,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33342 states and 53365 transitions. [2025-03-08 10:56:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:56:28,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:28,277 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:56:28,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:28,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash 421164389, now seen corresponding path program 1 times [2025-03-08 10:56:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:28,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792315175] [2025-03-08 10:56:28,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:28,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:28,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:56:28,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:56:28,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:28,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792315175] [2025-03-08 10:56:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792315175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:28,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959741447] [2025-03-08 10:56:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:28,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:28,549 INFO L87 Difference]: Start difference. First operand 33342 states and 53365 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:31,974 INFO L93 Difference]: Finished difference Result 83350 states and 133257 transitions. [2025-03-08 10:56:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-03-08 10:56:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:32,164 INFO L225 Difference]: With dead ends: 83350 [2025-03-08 10:56:32,165 INFO L226 Difference]: Without dead ends: 50120 [2025-03-08 10:56:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 10:56:32,243 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 235 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 751 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50120 states. [2025-03-08 10:56:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50120 to 50118. [2025-03-08 10:56:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50118 states, 36249 states have (on average 1.4787994151562802) internal successors, (53605), 36538 states have internal predecessors, (53605), 13199 states have call successors, (13199), 669 states have call predecessors, (13199), 669 states have return successors, (13199), 12910 states have call predecessors, (13199), 13199 states have call successors, (13199) [2025-03-08 10:56:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50118 states to 50118 states and 80003 transitions. [2025-03-08 10:56:36,074 INFO L78 Accepts]: Start accepts. Automaton has 50118 states and 80003 transitions. Word has length 519 [2025-03-08 10:56:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:36,075 INFO L471 AbstractCegarLoop]: Abstraction has 50118 states and 80003 transitions. [2025-03-08 10:56:36,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50118 states and 80003 transitions. [2025-03-08 10:56:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:56:36,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:36,087 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:36,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 10:56:36,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -501519194, now seen corresponding path program 1 times [2025-03-08 10:56:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477280044] [2025-03-08 10:56:36,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:56:36,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:56:36,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:36,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477280044] [2025-03-08 10:56:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477280044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:37,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:56:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606831067] [2025-03-08 10:56:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:56:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:37,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:56:37,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:56:37,956 INFO L87 Difference]: Start difference. First operand 50118 states and 80003 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:45,407 INFO L93 Difference]: Finished difference Result 84774 states and 135759 transitions. [2025-03-08 10:56:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:56:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 519 [2025-03-08 10:56:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:45,594 INFO L225 Difference]: With dead ends: 84774 [2025-03-08 10:56:45,594 INFO L226 Difference]: Without dead ends: 51440 [2025-03-08 10:56:45,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:56:45,668 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 2132 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 4490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:45,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 4267 Invalid, 4490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 10:56:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51440 states. [2025-03-08 10:56:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51440 to 48272. [2025-03-08 10:56:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48272 states, 35095 states have (on average 1.4788716341359167) internal successors, (51901), 35370 states have internal predecessors, (51901), 12533 states have call successors, (12533), 643 states have call predecessors, (12533), 643 states have return successors, (12533), 12258 states have call predecessors, (12533), 12533 states have call successors, (12533) [2025-03-08 10:56:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48272 states to 48272 states and 76967 transitions. [2025-03-08 10:56:49,704 INFO L78 Accepts]: Start accepts. Automaton has 48272 states and 76967 transitions. Word has length 519 [2025-03-08 10:56:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 48272 states and 76967 transitions. [2025-03-08 10:56:49,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 10:56:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 48272 states and 76967 transitions. [2025-03-08 10:56:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:56:49,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:49,716 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:49,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 10:56:49,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:49,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2092707623, now seen corresponding path program 1 times [2025-03-08 10:56:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:49,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71120484] [2025-03-08 10:56:49,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:49,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:56:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:56:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:49,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:56:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71120484] [2025-03-08 10:56:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71120484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:56:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513498416] [2025-03-08 10:56:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:56:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:49,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:56:49,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:56:49,998 INFO L87 Difference]: Start difference. First operand 48272 states and 76967 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:56:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:56,712 INFO L93 Difference]: Finished difference Result 98526 states and 157335 transitions. [2025-03-08 10:56:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:56:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-03-08 10:56:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:56,952 INFO L225 Difference]: With dead ends: 98526 [2025-03-08 10:56:56,952 INFO L226 Difference]: Without dead ends: 67230 [2025-03-08 10:56:57,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:56:57,028 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 1269 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:57,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1690 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:56:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67230 states. [2025-03-08 10:57:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67230 to 65716. [2025-03-08 10:57:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65716 states, 47391 states have (on average 1.467092907936106) internal successors, (69527), 47760 states have internal predecessors, (69527), 17423 states have call successors, (17423), 901 states have call predecessors, (17423), 901 states have return successors, (17423), 17054 states have call predecessors, (17423), 17423 states have call successors, (17423) [2025-03-08 10:57:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65716 states to 65716 states and 104373 transitions. [2025-03-08 10:57:01,987 INFO L78 Accepts]: Start accepts. Automaton has 65716 states and 104373 transitions. Word has length 519 [2025-03-08 10:57:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 65716 states and 104373 transitions. [2025-03-08 10:57:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 10:57:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65716 states and 104373 transitions. [2025-03-08 10:57:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-08 10:57:02,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:02,001 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 10:57:02,001 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1899998376, now seen corresponding path program 1 times [2025-03-08 10:57:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622458634] [2025-03-08 10:57:02,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:02,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-08 10:57:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-08 10:57:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 10:57:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622458634] [2025-03-08 10:57:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622458634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:57:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878513447] [2025-03-08 10:57:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:57:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:02,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:57:02,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:57:02,904 INFO L87 Difference]: Start difference. First operand 65716 states and 104373 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82)