./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.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 0607320856a723cba5c45620dc48c23e9cc5398f6903ed9b1f8db191149985ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:09:42,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:09:42,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:09:42,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:09:42,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:09:42,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:09:42,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:09:42,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:09:42,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:09:42,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:09:42,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:09:42,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:09:42,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:09:42,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:09:42,099 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:09:42,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:09:42,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:09:42,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:09:42,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:09:42,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:09:42,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:09:42,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:09:42,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:09:42,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:09:42,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:09:42,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:09:42,102 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 -> 0607320856a723cba5c45620dc48c23e9cc5398f6903ed9b1f8db191149985ff [2025-03-03 20:09:42,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:09:42,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:09:42,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:09:42,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:09:42,342 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:09:42,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.i [2025-03-03 20:09:43,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f814e67/691ab9cfd3d543bb9647eee7edf869df/FLAGf47d5c450 [2025-03-03 20:09:43,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:09:43,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.i [2025-03-03 20:09:43,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f814e67/691ab9cfd3d543bb9647eee7edf869df/FLAGf47d5c450 [2025-03-03 20:09:44,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f814e67/691ab9cfd3d543bb9647eee7edf869df [2025-03-03 20:09:44,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:09:44,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:09:44,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:09:44,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:09:44,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:09:44,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44, skipping insertion in model container [2025-03-03 20:09:44,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:09:44,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.i[916,929] [2025-03-03 20:09:44,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:09:44,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:09:44,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-60.i[916,929] [2025-03-03 20:09:44,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:09:44,452 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:09:44,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44 WrapperNode [2025-03-03 20:09:44,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:09:44,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:09:44,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:09:44,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:09:44,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,536 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 880 [2025-03-03 20:09:44,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:09:44,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:09:44,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:09:44,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:09:44,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,592 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:09:44,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:09:44,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:09:44,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:09:44,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:09:44,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (1/1) ... [2025-03-03 20:09:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:09:44,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:44,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:09:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:09:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:09:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:09:44,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:09:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:09:44,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:09:44,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:09:44,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:09:44,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:09:45,926 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 20:09:45,927 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:09:45,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:09:45,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:09:45,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:09:45 BoogieIcfgContainer [2025-03-03 20:09:45,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:09:45,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:09:45,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:09:45,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:09:45,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:09:44" (1/3) ... [2025-03-03 20:09:45,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69278a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:09:45, skipping insertion in model container [2025-03-03 20:09:45,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:44" (2/3) ... [2025-03-03 20:09:45,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69278a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:09:45, skipping insertion in model container [2025-03-03 20:09:45,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:09:45" (3/3) ... [2025-03-03 20:09:45,982 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-60.i [2025-03-03 20:09:45,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:09:45,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-60.i that has 2 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:09:46,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:09:46,058 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;@79df36db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:09:46,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:09:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 257 states have (on average 1.5914396887159532) internal successors, (409), 258 states have internal predecessors, (409), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:09:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-03-03 20:09:46,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:46,089 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:46,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -937594534, now seen corresponding path program 1 times [2025-03-03 20:09:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141624549] [2025-03-03 20:09:46,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-03 20:09:46,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-03 20:09:46,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:46,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:09:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141624549] [2025-03-03 20:09:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141624549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053830563] [2025-03-03 20:09:46,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:46,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:09:46,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:09:46,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-03 20:09:47,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-03 20:09:47,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:47,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:47,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:09:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:09:47,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:09:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053830563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:47,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:09:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:09:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424114212] [2025-03-03 20:09:47,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:09:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:47,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:09:47,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:09:47,127 INFO L87 Difference]: Start difference. First operand has 365 states, 257 states have (on average 1.5914396887159532) internal successors, (409), 258 states have internal predecessors, (409), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:09:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:47,209 INFO L93 Difference]: Finished difference Result 724 states and 1338 transitions. [2025-03-03 20:09:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:09:47,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 677 [2025-03-03 20:09:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:47,218 INFO L225 Difference]: With dead ends: 724 [2025-03-03 20:09:47,218 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 20:09:47,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:09:47,224 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:47,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 20:09:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-03 20:09:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:09:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 613 transitions. [2025-03-03 20:09:47,298 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 613 transitions. Word has length 677 [2025-03-03 20:09:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:47,299 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 613 transitions. [2025-03-03 20:09:47,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:09:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 613 transitions. [2025-03-03 20:09:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-03-03 20:09:47,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:47,310 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:47,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:09:47,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:09:47,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:47,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1808720195, now seen corresponding path program 1 times [2025-03-03 20:09:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099091770] [2025-03-03 20:09:47,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-03 20:09:47,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-03 20:09:47,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:47,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099091770] [2025-03-03 20:09:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099091770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916195169] [2025-03-03 20:09:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:48,135 INFO L87 Difference]: Start difference. First operand 362 states and 613 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:48,276 INFO L93 Difference]: Finished difference Result 979 states and 1666 transitions. [2025-03-03 20:09:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 677 [2025-03-03 20:09:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:48,288 INFO L225 Difference]: With dead ends: 979 [2025-03-03 20:09:48,290 INFO L226 Difference]: Without dead ends: 620 [2025-03-03 20:09:48,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:48,292 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 437 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:48,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1549 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-03 20:09:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2025-03-03 20:09:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 454 states have (on average 1.6123348017621146) internal successors, (732), 455 states have internal predecessors, (732), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 159 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 20:09:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1052 transitions. [2025-03-03 20:09:48,363 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1052 transitions. Word has length 677 [2025-03-03 20:09:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:48,365 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 1052 transitions. [2025-03-03 20:09:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1052 transitions. [2025-03-03 20:09:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-03 20:09:48,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:48,371 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:48,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:09:48,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:48,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -195736409, now seen corresponding path program 1 times [2025-03-03 20:09:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469605767] [2025-03-03 20:09:48,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:48,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-03 20:09:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-03 20:09:48,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:48,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469605767] [2025-03-03 20:09:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469605767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662864646] [2025-03-03 20:09:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:48,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:48,655 INFO L87 Difference]: Start difference. First operand 617 states and 1052 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:48,773 INFO L93 Difference]: Finished difference Result 1683 states and 2881 transitions. [2025-03-03 20:09:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 678 [2025-03-03 20:09:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:48,789 INFO L225 Difference]: With dead ends: 1683 [2025-03-03 20:09:48,789 INFO L226 Difference]: Without dead ends: 1069 [2025-03-03 20:09:48,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:48,794 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 378 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:48,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1311 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-03-03 20:09:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1065. [2025-03-03 20:09:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 836 states have (on average 1.644736842105263) internal successors, (1375), 839 states have internal predecessors, (1375), 224 states have call successors, (224), 4 states have call predecessors, (224), 4 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:09:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1823 transitions. [2025-03-03 20:09:48,903 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1823 transitions. Word has length 678 [2025-03-03 20:09:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:48,904 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1823 transitions. [2025-03-03 20:09:48,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1823 transitions. [2025-03-03 20:09:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-03 20:09:48,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:48,910 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:09:48,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash -472873785, now seen corresponding path program 1 times [2025-03-03 20:09:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35812614] [2025-03-03 20:09:48,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:48,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-03 20:09:48,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-03 20:09:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:48,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:49,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:49,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35812614] [2025-03-03 20:09:49,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35812614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:49,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:49,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521435165] [2025-03-03 20:09:49,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:49,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:49,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:49,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:49,171 INFO L87 Difference]: Start difference. First operand 1065 states and 1823 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:49,304 INFO L93 Difference]: Finished difference Result 2905 states and 4982 transitions. [2025-03-03 20:09:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 678 [2025-03-03 20:09:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:49,316 INFO L225 Difference]: With dead ends: 2905 [2025-03-03 20:09:49,316 INFO L226 Difference]: Without dead ends: 1843 [2025-03-03 20:09:49,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:49,320 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 355 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:49,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-03 20:09:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1839. [2025-03-03 20:09:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1444 states have (on average 1.6433518005540166) internal successors, (2373), 1451 states have internal predecessors, (2373), 386 states have call successors, (386), 8 states have call predecessors, (386), 8 states have return successors, (386), 379 states have call predecessors, (386), 386 states have call successors, (386) [2025-03-03 20:09:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 3145 transitions. [2025-03-03 20:09:49,436 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 3145 transitions. Word has length 678 [2025-03-03 20:09:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:49,437 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 3145 transitions. [2025-03-03 20:09:49,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 3145 transitions. [2025-03-03 20:09:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-03 20:09:49,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:49,443 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:09:49,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1148476184, now seen corresponding path program 1 times [2025-03-03 20:09:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356281596] [2025-03-03 20:09:49,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:49,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-03 20:09:49,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-03 20:09:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356281596] [2025-03-03 20:09:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356281596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:49,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:49,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682936269] [2025-03-03 20:09:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:49,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:49,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:49,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:49,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:49,673 INFO L87 Difference]: Start difference. First operand 1839 states and 3145 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:49,862 INFO L93 Difference]: Finished difference Result 5511 states and 9429 transitions. [2025-03-03 20:09:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 678 [2025-03-03 20:09:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:49,883 INFO L225 Difference]: With dead ends: 5511 [2025-03-03 20:09:49,884 INFO L226 Difference]: Without dead ends: 3675 [2025-03-03 20:09:49,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:49,890 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 607 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:49,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1307 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2025-03-03 20:09:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3673. [2025-03-03 20:09:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 2884 states have (on average 1.6386962552011095) internal successors, (4726), 2898 states have internal predecessors, (4726), 772 states have call successors, (772), 16 states have call predecessors, (772), 16 states have return successors, (772), 758 states have call predecessors, (772), 772 states have call successors, (772) [2025-03-03 20:09:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 6270 transitions. [2025-03-03 20:09:50,105 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 6270 transitions. Word has length 678 [2025-03-03 20:09:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 3673 states and 6270 transitions. [2025-03-03 20:09:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 6270 transitions. [2025-03-03 20:09:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-03 20:09:50,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:50,118 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:50,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:09:50,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:50,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1210830825, now seen corresponding path program 1 times [2025-03-03 20:09:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961510174] [2025-03-03 20:09:50,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:50,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-03 20:09:50,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-03 20:09:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961510174] [2025-03-03 20:09:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961510174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:50,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977782874] [2025-03-03 20:09:50,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:50,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:50,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:50,398 INFO L87 Difference]: Start difference. First operand 3673 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:50,702 INFO L93 Difference]: Finished difference Result 10349 states and 17642 transitions. [2025-03-03 20:09:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 678 [2025-03-03 20:09:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:50,746 INFO L225 Difference]: With dead ends: 10349 [2025-03-03 20:09:50,747 INFO L226 Difference]: Without dead ends: 6679 [2025-03-03 20:09:50,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:50,761 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 406 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:50,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1314 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2025-03-03 20:09:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6295. [2025-03-03 20:09:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6295 states, 4890 states have (on average 1.6151329243353783) internal successors, (7898), 4920 states have internal predecessors, (7898), 1372 states have call successors, (1372), 32 states have call predecessors, (1372), 32 states have return successors, (1372), 1342 states have call predecessors, (1372), 1372 states have call successors, (1372) [2025-03-03 20:09:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 10642 transitions. [2025-03-03 20:09:51,137 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 10642 transitions. Word has length 678 [2025-03-03 20:09:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:51,139 INFO L471 AbstractCegarLoop]: Abstraction has 6295 states and 10642 transitions. [2025-03-03 20:09:51,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 10642 transitions. [2025-03-03 20:09:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 20:09:51,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:51,147 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:51,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:09:51,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:51,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 14472007, now seen corresponding path program 1 times [2025-03-03 20:09:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188202177] [2025-03-03 20:09:51,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:51,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 20:09:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 20:09:51,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:51,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188202177] [2025-03-03 20:09:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188202177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981876198] [2025-03-03 20:09:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:51,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:51,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:51,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:51,359 INFO L87 Difference]: Start difference. First operand 6295 states and 10642 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:51,730 INFO L93 Difference]: Finished difference Result 12599 states and 21290 transitions. [2025-03-03 20:09:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 679 [2025-03-03 20:09:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:51,772 INFO L225 Difference]: With dead ends: 12599 [2025-03-03 20:09:51,772 INFO L226 Difference]: Without dead ends: 6307 [2025-03-03 20:09:51,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:51,790 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 407 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:51,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1208 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2025-03-03 20:09:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 4185. [2025-03-03 20:09:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3430 states have (on average 1.632069970845481) internal successors, (5598), 3444 states have internal predecessors, (5598), 736 states have call successors, (736), 18 states have call predecessors, (736), 18 states have return successors, (736), 722 states have call predecessors, (736), 736 states have call successors, (736) [2025-03-03 20:09:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 7070 transitions. [2025-03-03 20:09:52,162 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 7070 transitions. Word has length 679 [2025-03-03 20:09:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:52,163 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 7070 transitions. [2025-03-03 20:09:52,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 7070 transitions. [2025-03-03 20:09:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 20:09:52,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:52,173 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:52,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:09:52,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:52,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -908211576, now seen corresponding path program 1 times [2025-03-03 20:09:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659163627] [2025-03-03 20:09:52,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:52,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 20:09:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 20:09:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659163627] [2025-03-03 20:09:52,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659163627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:09:52,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360261956] [2025-03-03 20:09:52,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:52,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:09:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:09:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:09:52,455 INFO L87 Difference]: Start difference. First operand 4185 states and 7070 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:53,242 INFO L93 Difference]: Finished difference Result 17241 states and 28898 transitions. [2025-03-03 20:09:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:09:53,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 679 [2025-03-03 20:09:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:53,304 INFO L225 Difference]: With dead ends: 17241 [2025-03-03 20:09:53,305 INFO L226 Difference]: Without dead ends: 13059 [2025-03-03 20:09:53,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:09:53,321 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 1196 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:53,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 3236 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:09:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13059 states. [2025-03-03 20:09:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13059 to 13047. [2025-03-03 20:09:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13047 states, 10146 states have (on average 1.5820027597082593) internal successors, (16051), 10206 states have internal predecessors, (16051), 2828 states have call successors, (2828), 72 states have call predecessors, (2828), 72 states have return successors, (2828), 2768 states have call predecessors, (2828), 2828 states have call successors, (2828) [2025-03-03 20:09:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13047 states to 13047 states and 21707 transitions. [2025-03-03 20:09:54,087 INFO L78 Accepts]: Start accepts. Automaton has 13047 states and 21707 transitions. Word has length 679 [2025-03-03 20:09:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:54,089 INFO L471 AbstractCegarLoop]: Abstraction has 13047 states and 21707 transitions. [2025-03-03 20:09:54,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13047 states and 21707 transitions. [2025-03-03 20:09:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 20:09:54,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:54,105 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:09:54,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 299706599, now seen corresponding path program 1 times [2025-03-03 20:09:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8106094] [2025-03-03 20:09:54,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:54,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 20:09:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 20:09:54,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:54,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8106094] [2025-03-03 20:09:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8106094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:54,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008874455] [2025-03-03 20:09:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:54,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:54,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:54,370 INFO L87 Difference]: Start difference. First operand 13047 states and 21707 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:54,807 INFO L93 Difference]: Finished difference Result 26253 states and 43540 transitions. [2025-03-03 20:09:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 679 [2025-03-03 20:09:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:54,853 INFO L225 Difference]: With dead ends: 26253 [2025-03-03 20:09:54,853 INFO L226 Difference]: Without dead ends: 13209 [2025-03-03 20:09:54,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:54,889 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 329 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:54,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13209 states. [2025-03-03 20:09:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13209 to 10623. [2025-03-03 20:09:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10623 states, 8746 states have (on average 1.6093071118225475) internal successors, (14075), 8774 states have internal predecessors, (14075), 1804 states have call successors, (1804), 72 states have call predecessors, (1804), 72 states have return successors, (1804), 1776 states have call predecessors, (1804), 1804 states have call successors, (1804) [2025-03-03 20:09:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10623 states to 10623 states and 17683 transitions. [2025-03-03 20:09:55,364 INFO L78 Accepts]: Start accepts. Automaton has 10623 states and 17683 transitions. Word has length 679 [2025-03-03 20:09:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 10623 states and 17683 transitions. [2025-03-03 20:09:55,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10623 states and 17683 transitions. [2025-03-03 20:09:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 20:09:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:55,376 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:09:55,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:55,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1653016296, now seen corresponding path program 1 times [2025-03-03 20:09:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778972847] [2025-03-03 20:09:55,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:55,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 20:09:55,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 20:09:55,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:55,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778972847] [2025-03-03 20:09:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778972847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164024578] [2025-03-03 20:09:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:55,564 INFO L87 Difference]: Start difference. First operand 10623 states and 17683 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:55,916 INFO L93 Difference]: Finished difference Result 22301 states and 36964 transitions. [2025-03-03 20:09:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:55,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 679 [2025-03-03 20:09:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:55,953 INFO L225 Difference]: With dead ends: 22301 [2025-03-03 20:09:55,954 INFO L226 Difference]: Without dead ends: 11681 [2025-03-03 20:09:55,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:55,975 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 50 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1212 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2025-03-03 20:09:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11647. [2025-03-03 20:09:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11647 states, 9354 states have (on average 1.5868077827667308) internal successors, (14843), 9414 states have internal predecessors, (14843), 2188 states have call successors, (2188), 104 states have call predecessors, (2188), 104 states have return successors, (2188), 2128 states have call predecessors, (2188), 2188 states have call successors, (2188) [2025-03-03 20:09:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11647 states to 11647 states and 19219 transitions. [2025-03-03 20:09:56,506 INFO L78 Accepts]: Start accepts. Automaton has 11647 states and 19219 transitions. Word has length 679 [2025-03-03 20:09:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:56,507 INFO L471 AbstractCegarLoop]: Abstraction has 11647 states and 19219 transitions. [2025-03-03 20:09:56,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11647 states and 19219 transitions. [2025-03-03 20:09:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:09:56,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:56,523 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:56,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:09:56,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1736620742, now seen corresponding path program 1 times [2025-03-03 20:09:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810002325] [2025-03-03 20:09:56,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:56,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:09:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:09:56,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:56,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810002325] [2025-03-03 20:09:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810002325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:56,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:09:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426247929] [2025-03-03 20:09:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:56,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:09:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:56,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:09:56,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:09:56,952 INFO L87 Difference]: Start difference. First operand 11647 states and 19219 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:58,088 INFO L93 Difference]: Finished difference Result 33612 states and 55864 transitions. [2025-03-03 20:09:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:09:58,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:09:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:58,154 INFO L225 Difference]: With dead ends: 33612 [2025-03-03 20:09:58,155 INFO L226 Difference]: Without dead ends: 21968 [2025-03-03 20:09:58,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:09:58,171 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 774 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:58,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2236 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:09:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21968 states. [2025-03-03 20:09:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21968 to 19574. [2025-03-03 20:09:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19574 states, 15899 states have (on average 1.59865400339644) internal successors, (25417), 15988 states have internal predecessors, (25417), 3503 states have call successors, (3503), 171 states have call predecessors, (3503), 171 states have return successors, (3503), 3414 states have call predecessors, (3503), 3503 states have call successors, (3503) [2025-03-03 20:09:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19574 states to 19574 states and 32423 transitions. [2025-03-03 20:09:58,834 INFO L78 Accepts]: Start accepts. Automaton has 19574 states and 32423 transitions. Word has length 680 [2025-03-03 20:09:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:58,835 INFO L471 AbstractCegarLoop]: Abstraction has 19574 states and 32423 transitions. [2025-03-03 20:09:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:09:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19574 states and 32423 transitions. [2025-03-03 20:09:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:09:58,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:58,847 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:58,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:09:58,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:58,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash -273001543, now seen corresponding path program 1 times [2025-03-03 20:09:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734825841] [2025-03-03 20:09:58,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:58,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:58,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:09:58,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:09:58,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:58,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:09:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734825841] [2025-03-03 20:09:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734825841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:59,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:59,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:09:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253528824] [2025-03-03 20:09:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:59,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:09:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:59,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:09:59,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:09:59,886 INFO L87 Difference]: Start difference. First operand 19574 states and 32423 transitions. Second operand has 18 states, 18 states have (on average 8.777777777777779) internal successors, (158), 18 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:10:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:10,995 INFO L93 Difference]: Finished difference Result 161184 states and 265560 transitions. [2025-03-03 20:10:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 20:10:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.777777777777779) internal successors, (158), 18 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:10:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:11,474 INFO L225 Difference]: With dead ends: 161184 [2025-03-03 20:10:11,475 INFO L226 Difference]: Without dead ends: 141710 [2025-03-03 20:10:11,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 20:10:11,561 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 10051 mSDsluCounter, 7948 mSDsCounter, 0 mSdLazyCounter, 4830 mSolverCounterSat, 2581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10051 SdHoareTripleChecker+Valid, 8672 SdHoareTripleChecker+Invalid, 7411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2581 IncrementalHoareTripleChecker+Valid, 4830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:11,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10051 Valid, 8672 Invalid, 7411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2581 Valid, 4830 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 20:10:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141710 states. [2025-03-03 20:10:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141710 to 52996. [2025-03-03 20:10:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52996 states, 44999 states have (on average 1.6178803973421632) internal successors, (72803), 45280 states have internal predecessors, (72803), 7535 states have call successors, (7535), 461 states have call predecessors, (7535), 461 states have return successors, (7535), 7254 states have call predecessors, (7535), 7535 states have call successors, (7535) [2025-03-03 20:10:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52996 states to 52996 states and 87873 transitions. [2025-03-03 20:10:15,737 INFO L78 Accepts]: Start accepts. Automaton has 52996 states and 87873 transitions. Word has length 680 [2025-03-03 20:10:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:15,739 INFO L471 AbstractCegarLoop]: Abstraction has 52996 states and 87873 transitions. [2025-03-03 20:10:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.777777777777779) internal successors, (158), 18 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:10:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52996 states and 87873 transitions. [2025-03-03 20:10:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:10:15,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:15,988 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:15,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:10:15,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:15,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:15,989 INFO L85 PathProgramCache]: Analyzing trace with hash -484352456, now seen corresponding path program 1 times [2025-03-03 20:10:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599478156] [2025-03-03 20:10:15,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:15,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:16,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:10:16,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:10:16,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:16,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:10:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599478156] [2025-03-03 20:10:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599478156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:10:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143470206] [2025-03-03 20:10:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:10:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:10:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:10:16,703 INFO L87 Difference]: Start difference. First operand 52996 states and 87873 transitions. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:10:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:26,702 INFO L93 Difference]: Finished difference Result 182090 states and 301599 transitions. [2025-03-03 20:10:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:10:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:10:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,071 INFO L225 Difference]: With dead ends: 182090 [2025-03-03 20:10:27,072 INFO L226 Difference]: Without dead ends: 129202 [2025-03-03 20:10:27,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-03-03 20:10:27,210 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 6766 mSDsluCounter, 6217 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6766 SdHoareTripleChecker+Valid, 7078 SdHoareTripleChecker+Invalid, 4565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6766 Valid, 7078 Invalid, 4565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:10:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129202 states. [2025-03-03 20:10:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129202 to 52264. [2025-03-03 20:10:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52264 states, 44267 states have (on average 1.6172543881446675) internal successors, (71591), 44548 states have internal predecessors, (71591), 7535 states have call successors, (7535), 461 states have call predecessors, (7535), 461 states have return successors, (7535), 7254 states have call predecessors, (7535), 7535 states have call successors, (7535) [2025-03-03 20:10:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52264 states to 52264 states and 86661 transitions. [2025-03-03 20:10:30,959 INFO L78 Accepts]: Start accepts. Automaton has 52264 states and 86661 transitions. Word has length 680 [2025-03-03 20:10:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:30,960 INFO L471 AbstractCegarLoop]: Abstraction has 52264 states and 86661 transitions. [2025-03-03 20:10:30,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:10:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 52264 states and 86661 transitions. [2025-03-03 20:10:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:10:30,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:30,986 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:30,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:10:30,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:30,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:30,987 INFO L85 PathProgramCache]: Analyzing trace with hash -721698182, now seen corresponding path program 1 times [2025-03-03 20:10:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:30,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101554110] [2025-03-03 20:10:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:31,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:10:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:10:31,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:31,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:10:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101554110] [2025-03-03 20:10:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101554110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:10:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030832767] [2025-03-03 20:10:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:10:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:31,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:10:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:10:31,868 INFO L87 Difference]: Start difference. First operand 52264 states and 86661 transitions. Second operand has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)