./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercodestructure_filler-pe-cn_file-81.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 f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:04:42,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:04:42,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:04:42,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:04:42,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:04:42,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:04:42,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:04:42,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:04:42,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:04:42,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:04:42,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:04:42,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:04:42,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:04:42,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:04:42,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:04:42,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:04:42,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:04:42,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:04:42,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:04:42,312 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 -> f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 [2025-03-17 01:04:42,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:04:42,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:04:42,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:04:42,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:04:42,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:04:42,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-17 01:04:43,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b5a9d77/c88a7eb9c9d844919dca0d6e0a491269/FLAG6553ffff5 [2025-03-17 01:04:44,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:04:44,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-17 01:04:44,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b5a9d77/c88a7eb9c9d844919dca0d6e0a491269/FLAG6553ffff5 [2025-03-17 01:04:44,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b5a9d77/c88a7eb9c9d844919dca0d6e0a491269 [2025-03-17 01:04:44,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:04:44,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:04:44,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:04:44,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:04:44,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:04:44,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44, skipping insertion in model container [2025-03-17 01:04:44,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:04:44,298 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_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-03-17 01:04:44,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:04:44,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:04:44,416 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_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-03-17 01:04:44,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:04:44,476 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:04:44,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44 WrapperNode [2025-03-17 01:04:44,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:04:44,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:04:44,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:04:44,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:04:44,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,543 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-17 01:04:44,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:04:44,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:04:44,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:04:44,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:04:44,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,582 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-17 01:04:44,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:04:44,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:04:44,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:04:44,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:04:44,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (1/1) ... [2025-03-17 01:04:44,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:04:44,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:04:44,654 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-17 01:04:44,660 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-17 01:04:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:04:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:04:44,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:04:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:04:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:04:44,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:04:44,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:04:44,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:04:45,211 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 01:04:45,258 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:04:45,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:04:45,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:04:45,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:04:45,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:04:45 BoogieIcfgContainer [2025-03-17 01:04:45,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:04:45,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:04:45,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:04:45,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:04:45,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:04:44" (1/3) ... [2025-03-17 01:04:45,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624c8c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:04:45, skipping insertion in model container [2025-03-17 01:04:45,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:04:44" (2/3) ... [2025-03-17 01:04:45,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624c8c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:04:45, skipping insertion in model container [2025-03-17 01:04:45,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:04:45" (3/3) ... [2025-03-17 01:04:45,281 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-03-17 01:04:45,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:04:45,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:04:45,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:04:45,371 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;@64fea706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:04:45,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:04:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:04:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:04:45,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:04:45,387 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:04:45,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:04:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:04:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 700946285, now seen corresponding path program 1 times [2025-03-17 01:04:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:04:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163276298] [2025-03-17 01:04:45,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:04:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:04:45,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:04:45,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:45,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:04:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 01:04:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:04:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163276298] [2025-03-17 01:04:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163276298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:04:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037366114] [2025-03-17 01:04:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:45,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:04:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:04:45,773 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-17 01:04:45,774 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-17 01:04:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:04:46,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:04:46,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:04:46,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:04:46,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:04:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 01:04:46,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:04:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037366114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:04:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:04:46,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:04:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843539171] [2025-03-17 01:04:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:04:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:04:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:04:46,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:04:46,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:04:46,134 INFO L87 Difference]: Start difference. First operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:04:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:04:46,203 INFO L93 Difference]: Finished difference Result 255 states and 466 transitions. [2025-03-17 01:04:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:04:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 303 [2025-03-17 01:04:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:04:46,211 INFO L225 Difference]: With dead ends: 255 [2025-03-17 01:04:46,213 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 01:04:46,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 304 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-17 01:04:46,220 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:04:46,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:04:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 01:04:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-17 01:04:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:04:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 205 transitions. [2025-03-17 01:04:46,271 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 205 transitions. Word has length 303 [2025-03-17 01:04:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:04:46,272 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 205 transitions. [2025-03-17 01:04:46,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:04:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 205 transitions. [2025-03-17 01:04:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:04:46,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:04:46,279 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:04:46,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:04:46,479 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-17 01:04:46,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:04:46,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:04:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1133595465, now seen corresponding path program 1 times [2025-03-17 01:04:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:04:46,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705921414] [2025-03-17 01:04:46,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:04:46,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:04:46,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:04:46,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:46,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:04:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:04:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:04:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705921414] [2025-03-17 01:04:47,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705921414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:04:47,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:04:47,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:04:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047453080] [2025-03-17 01:04:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:04:47,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:04:47,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:04:47,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:04:47,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:04:47,477 INFO L87 Difference]: Start difference. First operand 127 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:04:47,810 INFO L93 Difference]: Finished difference Result 380 states and 615 transitions. [2025-03-17 01:04:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:04:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 303 [2025-03-17 01:04:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:04:47,815 INFO L225 Difference]: With dead ends: 380 [2025-03-17 01:04:47,816 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 01:04:47,817 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-17 01:04:47,819 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 112 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:04:47,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 543 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:04:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 01:04:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-17 01:04:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:04:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 409 transitions. [2025-03-17 01:04:47,911 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 409 transitions. Word has length 303 [2025-03-17 01:04:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:04:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 409 transitions. [2025-03-17 01:04:47,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 409 transitions. [2025-03-17 01:04:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:04:47,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:04:47,919 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:04:47,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:04:47,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:04:47,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:04:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash -242894600, now seen corresponding path program 1 times [2025-03-17 01:04:47,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:04:47,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525850919] [2025-03-17 01:04:47,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:04:47,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:04:48,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:04:48,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:04:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:04:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:04:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525850919] [2025-03-17 01:04:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525850919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:04:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:04:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:04:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940796315] [2025-03-17 01:04:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:04:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:04:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:04:49,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:04:49,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:04:49,472 INFO L87 Difference]: Start difference. First operand 252 states and 409 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:04:50,565 INFO L93 Difference]: Finished difference Result 863 states and 1366 transitions. [2025-03-17 01:04:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:04:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:04:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:04:50,576 INFO L225 Difference]: With dead ends: 863 [2025-03-17 01:04:50,576 INFO L226 Difference]: Without dead ends: 612 [2025-03-17 01:04:50,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:04:50,578 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 287 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:04:50,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 613 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:04:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-17 01:04:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 266. [2025-03-17 01:04:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 161 states have (on average 1.3975155279503106) internal successors, (225), 161 states have internal predecessors, (225), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:04:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 425 transitions. [2025-03-17 01:04:50,657 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 425 transitions. Word has length 304 [2025-03-17 01:04:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:04:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 425 transitions. [2025-03-17 01:04:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 425 transitions. [2025-03-17 01:04:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:04:50,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:04:50,663 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:04:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:04:50,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:04:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:04:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1976560096, now seen corresponding path program 1 times [2025-03-17 01:04:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:04:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142038895] [2025-03-17 01:04:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:04:50,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:04:50,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:04:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:04:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:04:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:04:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142038895] [2025-03-17 01:04:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142038895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:04:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:04:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:04:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948161305] [2025-03-17 01:04:51,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:04:51,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:04:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:04:51,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:04:51,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:04:51,636 INFO L87 Difference]: Start difference. First operand 266 states and 425 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:04:53,078 INFO L93 Difference]: Finished difference Result 1150 states and 1811 transitions. [2025-03-17 01:04:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:04:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:04:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:04:53,084 INFO L225 Difference]: With dead ends: 1150 [2025-03-17 01:04:53,086 INFO L226 Difference]: Without dead ends: 885 [2025-03-17 01:04:53,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:04:53,088 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 503 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:04:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 870 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:04:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-17 01:04:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 266. [2025-03-17 01:04:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 161 states have (on average 1.3975155279503106) internal successors, (225), 161 states have internal predecessors, (225), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:04:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 425 transitions. [2025-03-17 01:04:53,202 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 425 transitions. Word has length 304 [2025-03-17 01:04:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:04:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 425 transitions. [2025-03-17 01:04:53,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:04:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 425 transitions. [2025-03-17 01:04:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:04:53,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:04:53,205 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:04:53,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:04:53,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:04:53,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:04:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1780046591, now seen corresponding path program 1 times [2025-03-17 01:04:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:04:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628632340] [2025-03-17 01:04:53,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:04:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:04:53,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:04:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:04:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:04:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628632340] [2025-03-17 01:05:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628632340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:05:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608613075] [2025-03-17 01:05:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:04,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:05:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:04,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:05:04,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:05:04,842 INFO L87 Difference]: Start difference. First operand 266 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:07,030 INFO L93 Difference]: Finished difference Result 872 states and 1408 transitions. [2025-03-17 01:05:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:05:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:05:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:07,034 INFO L225 Difference]: With dead ends: 872 [2025-03-17 01:05:07,034 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 01:05:07,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:05:07,036 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 640 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:07,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1094 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:05:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 01:05:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 337. [2025-03-17 01:05:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 232 states have (on average 1.4913793103448276) internal successors, (346), 232 states have internal predecessors, (346), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:05:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 546 transitions. [2025-03-17 01:05:07,100 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 546 transitions. Word has length 304 [2025-03-17 01:05:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 546 transitions. [2025-03-17 01:05:07,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 546 transitions. [2025-03-17 01:05:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:05:07,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:07,108 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:05:07,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1371222366, now seen corresponding path program 1 times [2025-03-17 01:05:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:07,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368966104] [2025-03-17 01:05:07,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:05:07,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:05:07,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:07,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368966104] [2025-03-17 01:05:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368966104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:05:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693145045] [2025-03-17 01:05:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:05:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:07,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:05:07,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:05:07,345 INFO L87 Difference]: Start difference. First operand 337 states and 546 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:07,449 INFO L93 Difference]: Finished difference Result 778 states and 1257 transitions. [2025-03-17 01:05:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:05:07,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:05:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:07,454 INFO L225 Difference]: With dead ends: 778 [2025-03-17 01:05:07,455 INFO L226 Difference]: Without dead ends: 442 [2025-03-17 01:05:07,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:05:07,458 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 76 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:07,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 592 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:05:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-17 01:05:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 438. [2025-03-17 01:05:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 325 states have internal predecessors, (487), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 01:05:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 703 transitions. [2025-03-17 01:05:07,535 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 703 transitions. Word has length 304 [2025-03-17 01:05:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:07,536 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 703 transitions. [2025-03-17 01:05:07,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 703 transitions. [2025-03-17 01:05:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:05:07,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:07,540 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:07,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:05:07,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:07,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1991397504, now seen corresponding path program 1 times [2025-03-17 01:05:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659870493] [2025-03-17 01:05:07,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:07,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:05:07,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:05:07,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:07,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:15,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:15,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659870493] [2025-03-17 01:05:15,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659870493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:15,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:15,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:05:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206709318] [2025-03-17 01:05:15,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:15,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:05:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:15,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:05:15,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:05:15,860 INFO L87 Difference]: Start difference. First operand 438 states and 703 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:17,824 INFO L93 Difference]: Finished difference Result 1040 states and 1668 transitions. [2025-03-17 01:05:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:05:17,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:05:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:17,831 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 01:05:17,832 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 01:05:17,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:05:17,835 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 438 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:17,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 794 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:05:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 01:05:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 438. [2025-03-17 01:05:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 325 states have internal predecessors, (487), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 01:05:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 703 transitions. [2025-03-17 01:05:17,931 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 703 transitions. Word has length 304 [2025-03-17 01:05:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:17,932 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 703 transitions. [2025-03-17 01:05:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 703 transitions. [2025-03-17 01:05:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:05:17,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:17,934 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:17,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:05:17,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:17,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -258009698, now seen corresponding path program 1 times [2025-03-17 01:05:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521136685] [2025-03-17 01:05:17,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:05:17,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:05:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:18,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:18,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521136685] [2025-03-17 01:05:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521136685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:18,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:05:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203691586] [2025-03-17 01:05:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:18,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:05:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:18,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:05:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:05:18,760 INFO L87 Difference]: Start difference. First operand 438 states and 703 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:05:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:19,928 INFO L93 Difference]: Finished difference Result 1518 states and 2459 transitions. [2025-03-17 01:05:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:05:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 304 [2025-03-17 01:05:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:19,938 INFO L225 Difference]: With dead ends: 1518 [2025-03-17 01:05:19,939 INFO L226 Difference]: Without dead ends: 1081 [2025-03-17 01:05:19,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:05:19,941 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 661 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:19,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1092 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:05:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-17 01:05:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 532. [2025-03-17 01:05:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 367 states have internal predecessors, (533), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 849 transitions. [2025-03-17 01:05:20,019 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 849 transitions. Word has length 304 [2025-03-17 01:05:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:20,020 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 849 transitions. [2025-03-17 01:05:20,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:05:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 849 transitions. [2025-03-17 01:05:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:05:20,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:20,023 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:20,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:05:20,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:20,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash -325016451, now seen corresponding path program 1 times [2025-03-17 01:05:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:20,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112104380] [2025-03-17 01:05:20,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:20,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:05:20,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:05:20,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:20,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112104380] [2025-03-17 01:05:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112104380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:05:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941461229] [2025-03-17 01:05:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:20,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:05:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:20,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:05:20,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:05:20,614 INFO L87 Difference]: Start difference. First operand 532 states and 849 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:21,208 INFO L93 Difference]: Finished difference Result 1172 states and 1887 transitions. [2025-03-17 01:05:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:05:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:05:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:21,214 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 01:05:21,214 INFO L226 Difference]: Without dead ends: 735 [2025-03-17 01:05:21,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:05:21,218 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 182 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:21,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 841 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:05:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-17 01:05:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 532. [2025-03-17 01:05:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 367 states have internal predecessors, (533), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 849 transitions. [2025-03-17 01:05:21,285 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 849 transitions. Word has length 304 [2025-03-17 01:05:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 849 transitions. [2025-03-17 01:05:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 849 transitions. [2025-03-17 01:05:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:21,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:21,288 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:21,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:05:21,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1330043116, now seen corresponding path program 1 times [2025-03-17 01:05:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90586217] [2025-03-17 01:05:21,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:21,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:28,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90586217] [2025-03-17 01:05:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90586217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:05:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647049084] [2025-03-17 01:05:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:28,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:05:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:28,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:05:28,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:05:28,215 INFO L87 Difference]: Start difference. First operand 532 states and 849 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:30,501 INFO L93 Difference]: Finished difference Result 1778 states and 2882 transitions. [2025-03-17 01:05:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:05:30,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:30,510 INFO L225 Difference]: With dead ends: 1778 [2025-03-17 01:05:30,510 INFO L226 Difference]: Without dead ends: 1341 [2025-03-17 01:05:30,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:05:30,513 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 978 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:30,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1225 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:05:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-03-17 01:05:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 537. [2025-03-17 01:05:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 370 states have (on average 1.462162162162162) internal successors, (541), 372 states have internal predecessors, (541), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 857 transitions. [2025-03-17 01:05:30,630 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 857 transitions. Word has length 305 [2025-03-17 01:05:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 857 transitions. [2025-03-17 01:05:30,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 857 transitions. [2025-03-17 01:05:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:30,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:30,636 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:30,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:05:30,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:30,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:30,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1738867341, now seen corresponding path program 1 times [2025-03-17 01:05:30,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:30,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363515942] [2025-03-17 01:05:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:30,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:30,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:30,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363515942] [2025-03-17 01:05:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363515942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:35,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:35,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:05:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848841302] [2025-03-17 01:05:35,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:35,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:05:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:35,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:05:35,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:05:35,083 INFO L87 Difference]: Start difference. First operand 537 states and 857 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:35,703 INFO L93 Difference]: Finished difference Result 1585 states and 2565 transitions. [2025-03-17 01:05:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:05:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:35,713 INFO L225 Difference]: With dead ends: 1585 [2025-03-17 01:05:35,713 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 01:05:35,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:05:35,715 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 640 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:35,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1072 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:05:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 01:05:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 610. [2025-03-17 01:05:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 443 states have (on average 1.4988713318284423) internal successors, (664), 445 states have internal predecessors, (664), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 980 transitions. [2025-03-17 01:05:35,795 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 980 transitions. Word has length 305 [2025-03-17 01:05:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:35,796 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 980 transitions. [2025-03-17 01:05:35,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 980 transitions. [2025-03-17 01:05:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:35,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:35,798 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:35,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:05:35,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:35,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1118692203, now seen corresponding path program 1 times [2025-03-17 01:05:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899889803] [2025-03-17 01:05:35,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:35,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:35,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:35,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:35,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899889803] [2025-03-17 01:05:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899889803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:05:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435713618] [2025-03-17 01:05:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:40,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:05:40,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:05:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:05:40,369 INFO L87 Difference]: Start difference. First operand 610 states and 980 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:43,147 INFO L93 Difference]: Finished difference Result 1666 states and 2693 transitions. [2025-03-17 01:05:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:05:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:43,154 INFO L225 Difference]: With dead ends: 1666 [2025-03-17 01:05:43,154 INFO L226 Difference]: Without dead ends: 1158 [2025-03-17 01:05:43,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:05:43,157 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 429 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1599 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 01:05:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-03-17 01:05:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 608. [2025-03-17 01:05:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 441 states have (on average 1.5011337868480725) internal successors, (662), 443 states have internal predecessors, (662), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 978 transitions. [2025-03-17 01:05:43,230 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 978 transitions. Word has length 305 [2025-03-17 01:05:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:43,230 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 978 transitions. [2025-03-17 01:05:43,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 978 transitions. [2025-03-17 01:05:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:43,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:43,232 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:05:43,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1527516428, now seen corresponding path program 1 times [2025-03-17 01:05:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839713668] [2025-03-17 01:05:43,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:43,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:43,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:43,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:43,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:47,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839713668] [2025-03-17 01:05:47,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839713668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:47,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:05:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019572846] [2025-03-17 01:05:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:47,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:05:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:47,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:05:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:05:47,650 INFO L87 Difference]: Start difference. First operand 608 states and 978 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:05:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:49,651 INFO L93 Difference]: Finished difference Result 1760 states and 2868 transitions. [2025-03-17 01:05:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:05:49,652 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 305 [2025-03-17 01:05:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:49,657 INFO L225 Difference]: With dead ends: 1760 [2025-03-17 01:05:49,658 INFO L226 Difference]: Without dead ends: 1250 [2025-03-17 01:05:49,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-17 01:05:49,660 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 824 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:49,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1449 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:05:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-17 01:05:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 611. [2025-03-17 01:05:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 444 states have (on average 1.5) internal successors, (666), 446 states have internal predecessors, (666), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 982 transitions. [2025-03-17 01:05:49,735 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 982 transitions. Word has length 305 [2025-03-17 01:05:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:49,735 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 982 transitions. [2025-03-17 01:05:49,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:05:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 982 transitions. [2025-03-17 01:05:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:49,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:49,737 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:49,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:05:49,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:49,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1594523181, now seen corresponding path program 1 times [2025-03-17 01:05:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:49,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277567097] [2025-03-17 01:05:49,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:49,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:49,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:49,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:49,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277567097] [2025-03-17 01:05:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277567097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:05:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745838549] [2025-03-17 01:05:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:50,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:05:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:05:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:05:50,510 INFO L87 Difference]: Start difference. First operand 611 states and 982 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:51,447 INFO L93 Difference]: Finished difference Result 1465 states and 2371 transitions. [2025-03-17 01:05:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:05:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:51,453 INFO L225 Difference]: With dead ends: 1465 [2025-03-17 01:05:51,453 INFO L226 Difference]: Without dead ends: 955 [2025-03-17 01:05:51,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:05:51,456 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 492 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 827 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:05:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-17 01:05:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 609. [2025-03-17 01:05:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 442 states have (on average 1.502262443438914) internal successors, (664), 444 states have internal predecessors, (664), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 01:05:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 980 transitions. [2025-03-17 01:05:51,566 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 980 transitions. Word has length 305 [2025-03-17 01:05:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:51,567 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 980 transitions. [2025-03-17 01:05:51,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 980 transitions. [2025-03-17 01:05:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:51,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:51,569 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:51,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:05:51,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 887714837, now seen corresponding path program 1 times [2025-03-17 01:05:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390007492] [2025-03-17 01:05:51,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:51,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:51,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390007492] [2025-03-17 01:05:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390007492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:05:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598715295] [2025-03-17 01:05:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:05:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:05:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:05:51,744 INFO L87 Difference]: Start difference. First operand 609 states and 980 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:51,887 INFO L93 Difference]: Finished difference Result 1261 states and 2034 transitions. [2025-03-17 01:05:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:05:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:51,891 INFO L225 Difference]: With dead ends: 1261 [2025-03-17 01:05:51,891 INFO L226 Difference]: Without dead ends: 751 [2025-03-17 01:05:51,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:05:51,893 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 128 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:51,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 667 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:05:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-17 01:05:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 491. [2025-03-17 01:05:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 331 states have (on average 1.4290030211480362) internal successors, (473), 331 states have internal predecessors, (473), 150 states have call successors, (150), 9 states have call predecessors, (150), 9 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 01:05:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 773 transitions. [2025-03-17 01:05:51,967 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 773 transitions. Word has length 305 [2025-03-17 01:05:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:51,968 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 773 transitions. [2025-03-17 01:05:51,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 773 transitions. [2025-03-17 01:05:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:51,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:51,969 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:05:51,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 478890612, now seen corresponding path program 1 times [2025-03-17 01:05:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556791381] [2025-03-17 01:05:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:52,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:05:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:05:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:05:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556791381] [2025-03-17 01:05:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556791381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:05:57,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:05:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:05:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259618329] [2025-03-17 01:05:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:05:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:05:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:05:57,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:05:57,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:05:57,627 INFO L87 Difference]: Start difference. First operand 491 states and 773 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:05:58,145 INFO L93 Difference]: Finished difference Result 1128 states and 1788 transitions. [2025-03-17 01:05:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:05:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:05:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:05:58,152 INFO L225 Difference]: With dead ends: 1128 [2025-03-17 01:05:58,152 INFO L226 Difference]: Without dead ends: 740 [2025-03-17 01:05:58,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:05:58,154 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 343 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:05:58,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 930 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:05:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-17 01:05:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 495. [2025-03-17 01:05:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 335 states have (on average 1.4298507462686567) internal successors, (479), 335 states have internal predecessors, (479), 150 states have call successors, (150), 9 states have call predecessors, (150), 9 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 01:05:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 779 transitions. [2025-03-17 01:05:58,237 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 779 transitions. Word has length 305 [2025-03-17 01:05:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:05:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 779 transitions. [2025-03-17 01:05:58,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:05:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 779 transitions. [2025-03-17 01:05:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:05:58,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:05:58,239 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:05:58,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:05:58,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:05:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:05:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 690241525, now seen corresponding path program 1 times [2025-03-17 01:05:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:05:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707376647] [2025-03-17 01:05:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:05:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:05:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:05:58,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:05:58,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:05:58,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat