./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.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_operatoramount_amount250_file-20.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 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:08:50,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:08:50,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:08:50,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:08:50,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:08:50,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:08:50,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:08:50,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:08:50,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:08:50,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:08:50,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:08:50,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:08:50,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:08:50,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:08:50,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:08:50,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:08:50,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:08:50,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:08:50,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:08:50,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:08:50,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:08:50,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:08:50,522 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 -> 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba [2025-03-04 00:08:50,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:08:50,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:08:50,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:08:50,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:08:50,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:08:50,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-03-04 00:08:51,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e24235b/3da9e943fe714d50b35186ec819763f6/FLAGf8ddc73f9 [2025-03-04 00:08:52,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:08:52,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-03-04 00:08:52,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e24235b/3da9e943fe714d50b35186ec819763f6/FLAGf8ddc73f9 [2025-03-04 00:08:52,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e24235b/3da9e943fe714d50b35186ec819763f6 [2025-03-04 00:08:52,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:08:52,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:08:52,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:08:52,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:08:52,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:08:52,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52, skipping insertion in model container [2025-03-04 00:08:52,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:08:52,662 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_operatoramount_amount250_file-20.i[916,929] [2025-03-04 00:08:52,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:08:52,764 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:08:52,773 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_operatoramount_amount250_file-20.i[916,929] [2025-03-04 00:08:52,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:08:52,866 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:08:52,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52 WrapperNode [2025-03-04 00:08:52,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:08:52,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:08:52,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:08:52,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:08:52,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,932 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-03-04 00:08:52,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:08:52,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:08:52,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:08:52,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:08:52,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,996 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-04 00:08:52,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:52,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:08:53,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:08:53,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:08:53,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:08:53,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (1/1) ... [2025-03-04 00:08:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:08:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:53,078 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-04 00:08:53,084 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-04 00:08:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:08:53,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:08:53,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:08:53,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:08:53,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:08:53,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:08:53,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:08:53,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:08:53,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~short42#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short45#1; [2025-03-04 00:08:53,971 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-04 00:08:53,975 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:08:53,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:08:53,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:08:53,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:08:53 BoogieIcfgContainer [2025-03-04 00:08:53,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:08:54,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:08:54,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:08:54,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:08:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:08:52" (1/3) ... [2025-03-04 00:08:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ea03a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:08:54, skipping insertion in model container [2025-03-04 00:08:54,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:08:52" (2/3) ... [2025-03-04 00:08:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ea03a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:08:54, skipping insertion in model container [2025-03-04 00:08:54,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:08:53" (3/3) ... [2025-03-04 00:08:54,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-20.i [2025-03-04 00:08:54,019 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:08:54,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-20.i that has 2 procedures, 189 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:08:54,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:08:54,084 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;@40bfa2d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:08:54,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:08:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:08:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:08:54,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:54,112 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:54,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:54,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1179728659, now seen corresponding path program 1 times [2025-03-04 00:08:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950846979] [2025-03-04 00:08:54,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:54,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:08:54,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:08:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-04 00:08:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950846979] [2025-03-04 00:08:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950846979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043683777] [2025-03-04 00:08:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:54,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:54,653 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-04 00:08:54,654 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-04 00:08:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:08:54,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:08:54,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:54,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:08:54,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-04 00:08:54,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:08:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043683777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:08:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:08:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854164832] [2025-03-04 00:08:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:54,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:08:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:08:54,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:08:54,985 INFO L87 Difference]: Start difference. First operand has 189 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:08:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:55,037 INFO L93 Difference]: Finished difference Result 371 states and 646 transitions. [2025-03-04 00:08:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:08:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 329 [2025-03-04 00:08:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:55,059 INFO L225 Difference]: With dead ends: 371 [2025-03-04 00:08:55,060 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 00:08:55,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 330 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-04 00:08:55,067 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:55,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:08:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 00:08:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 00:08:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 134 states have (on average 1.462686567164179) internal successors, (196), 134 states have internal predecessors, (196), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:08:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2025-03-04 00:08:55,135 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 329 [2025-03-04 00:08:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:55,136 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2025-03-04 00:08:55,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:08:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2025-03-04 00:08:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:08:55,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:55,142 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:55,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:08:55,342 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-04 00:08:55,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash -933461228, now seen corresponding path program 1 times [2025-03-04 00:08:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385186075] [2025-03-04 00:08:55,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:08:55,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:08:55,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:55,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385186075] [2025-03-04 00:08:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385186075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537307633] [2025-03-04 00:08:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:55,647 INFO L87 Difference]: Start difference. First operand 185 states and 294 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:55,775 INFO L93 Difference]: Finished difference Result 469 states and 745 transitions. [2025-03-04 00:08:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-03-04 00:08:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:55,784 INFO L225 Difference]: With dead ends: 469 [2025-03-04 00:08:55,785 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 00:08:55,786 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-04 00:08:55,789 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 160 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:55,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 599 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:08:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 00:08:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2025-03-04 00:08:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 230 states have (on average 1.508695652173913) internal successors, (347), 231 states have internal predecessors, (347), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:08:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 449 transitions. [2025-03-04 00:08:55,838 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 449 transitions. Word has length 329 [2025-03-04 00:08:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:55,838 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 449 transitions. [2025-03-04 00:08:55,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 449 transitions. [2025-03-04 00:08:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:08:55,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:55,842 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:55,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:08:55,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:55,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -941220587, now seen corresponding path program 1 times [2025-03-04 00:08:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495734535] [2025-03-04 00:08:55,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:08:55,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:08:55,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:55,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:56,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:56,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495734535] [2025-03-04 00:08:56,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495734535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:56,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:56,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539842364] [2025-03-04 00:08:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:56,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:56,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:56,148 INFO L87 Difference]: Start difference. First operand 284 states and 449 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:56,263 INFO L93 Difference]: Finished difference Result 572 states and 900 transitions. [2025-03-04 00:08:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-03-04 00:08:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:56,273 INFO L225 Difference]: With dead ends: 572 [2025-03-04 00:08:56,275 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 00:08:56,275 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-04 00:08:56,276 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 137 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 557 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:08:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 00:08:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 235. [2025-03-04 00:08:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:08:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 370 transitions. [2025-03-04 00:08:56,300 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 370 transitions. Word has length 329 [2025-03-04 00:08:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:56,303 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 370 transitions. [2025-03-04 00:08:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 370 transitions. [2025-03-04 00:08:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:08:56,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:56,308 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:08:56,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 20393430, now seen corresponding path program 1 times [2025-03-04 00:08:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360337503] [2025-03-04 00:08:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:56,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:08:56,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:08:56,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360337503] [2025-03-04 00:08:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360337503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:56,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:56,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:56,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120185446] [2025-03-04 00:08:56,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:56,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:56,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:56,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:56,529 INFO L87 Difference]: Start difference. First operand 235 states and 370 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:56,576 INFO L93 Difference]: Finished difference Result 469 states and 741 transitions. [2025-03-04 00:08:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-03-04 00:08:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:56,582 INFO L225 Difference]: With dead ends: 469 [2025-03-04 00:08:56,582 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 00:08:56,583 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-04 00:08:56,583 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:56,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:08:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 00:08:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-04 00:08:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 185 states have (on average 1.481081081081081) internal successors, (274), 185 states have internal predecessors, (274), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:08:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 372 transitions. [2025-03-04 00:08:56,608 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 372 transitions. Word has length 329 [2025-03-04 00:08:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 372 transitions. [2025-03-04 00:08:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 372 transitions. [2025-03-04 00:08:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-04 00:08:56,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:56,612 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:56,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:08:56,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 863048730, now seen corresponding path program 1 times [2025-03-04 00:08:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289337313] [2025-03-04 00:08:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:56,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-04 00:08:56,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 00:08:56,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289337313] [2025-03-04 00:08:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289337313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:08:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854044904] [2025-03-04 00:08:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:08:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:57,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:08:57,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:08:57,042 INFO L87 Difference]: Start difference. First operand 237 states and 372 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:57,321 INFO L93 Difference]: Finished difference Result 656 states and 1029 transitions. [2025-03-04 00:08:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:08:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 331 [2025-03-04 00:08:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:57,324 INFO L225 Difference]: With dead ends: 656 [2025-03-04 00:08:57,325 INFO L226 Difference]: Without dead ends: 422 [2025-03-04 00:08:57,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:08:57,326 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 185 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:57,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 916 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-04 00:08:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-03-04 00:08:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 317 states have (on average 1.4574132492113565) internal successors, (462), 317 states have internal predecessors, (462), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:08:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 658 transitions. [2025-03-04 00:08:57,376 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 658 transitions. Word has length 331 [2025-03-04 00:08:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:57,378 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 658 transitions. [2025-03-04 00:08:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 658 transitions. [2025-03-04 00:08:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-04 00:08:57,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:57,382 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:08:57,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1817873469, now seen corresponding path program 1 times [2025-03-04 00:08:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871862341] [2025-03-04 00:08:57,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:57,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-04 00:08:57,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-04 00:08:57,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:57,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:59,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871862341] [2025-03-04 00:08:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871862341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:59,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:08:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138932767] [2025-03-04 00:08:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:59,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:08:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:59,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:08:59,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:08:59,436 INFO L87 Difference]: Start difference. First operand 420 states and 658 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:01,423 INFO L93 Difference]: Finished difference Result 1445 states and 2239 transitions. [2025-03-04 00:09:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:09:01,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 332 [2025-03-04 00:09:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:01,432 INFO L225 Difference]: With dead ends: 1445 [2025-03-04 00:09:01,432 INFO L226 Difference]: Without dead ends: 1028 [2025-03-04 00:09:01,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:09:01,435 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 902 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:01,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2058 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:09:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-03-04 00:09:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 690. [2025-03-04 00:09:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.4431818181818181) internal successors, (762), 529 states have internal predecessors, (762), 153 states have call successors, (153), 8 states have call predecessors, (153), 8 states have return successors, (153), 152 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-04 00:09:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1068 transitions. [2025-03-04 00:09:01,552 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1068 transitions. Word has length 332 [2025-03-04 00:09:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:01,552 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1068 transitions. [2025-03-04 00:09:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1068 transitions. [2025-03-04 00:09:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-04 00:09:01,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:01,557 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:01,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:09:01,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:01,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash -157938338, now seen corresponding path program 1 times [2025-03-04 00:09:01,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:01,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444059936] [2025-03-04 00:09:01,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-04 00:09:01,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-04 00:09:01,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:02,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444059936] [2025-03-04 00:09:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444059936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:02,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860414860] [2025-03-04 00:09:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:02,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:02,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:02,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:02,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:02,339 INFO L87 Difference]: Start difference. First operand 690 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-04 00:09:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:02,850 INFO L93 Difference]: Finished difference Result 1768 states and 2726 transitions. [2025-03-04 00:09:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 332 [2025-03-04 00:09:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:02,857 INFO L225 Difference]: With dead ends: 1768 [2025-03-04 00:09:02,857 INFO L226 Difference]: Without dead ends: 1081 [2025-03-04 00:09:02,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:09:02,860 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 717 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:02,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1205 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-04 00:09:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1075. [2025-03-04 00:09:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 846 states have (on average 1.4479905437352245) internal successors, (1225), 849 states have internal predecessors, (1225), 214 states have call successors, (214), 14 states have call predecessors, (214), 14 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-04 00:09:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1653 transitions. [2025-03-04 00:09:02,924 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1653 transitions. Word has length 332 [2025-03-04 00:09:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:02,925 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1653 transitions. [2025-03-04 00:09:02,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-04 00:09:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1653 transitions. [2025-03-04 00:09:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:09:02,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:02,929 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:09:02,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:02,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1088479228, now seen corresponding path program 1 times [2025-03-04 00:09:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:02,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570676493] [2025-03-04 00:09:02,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:02,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:09:03,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:09:03,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:03,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:04,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:04,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570676493] [2025-03-04 00:09:04,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570676493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:04,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:04,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453679237] [2025-03-04 00:09:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:04,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:04,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:04,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:04,168 INFO L87 Difference]: Start difference. First operand 1075 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:04,654 INFO L93 Difference]: Finished difference Result 2276 states and 3494 transitions. [2025-03-04 00:09:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-03-04 00:09:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:04,666 INFO L225 Difference]: With dead ends: 2276 [2025-03-04 00:09:04,666 INFO L226 Difference]: Without dead ends: 1772 [2025-03-04 00:09:04,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:04,670 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 597 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:04,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 843 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-04 00:09:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1195. [2025-03-04 00:09:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 966 states have (on average 1.4710144927536233) internal successors, (1421), 969 states have internal predecessors, (1421), 214 states have call successors, (214), 14 states have call predecessors, (214), 14 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-04 00:09:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1849 transitions. [2025-03-04 00:09:04,762 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1849 transitions. Word has length 333 [2025-03-04 00:09:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:04,763 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1849 transitions. [2025-03-04 00:09:04,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1849 transitions. [2025-03-04 00:09:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:09:04,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:04,768 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:09:04,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1886853062, now seen corresponding path program 1 times [2025-03-04 00:09:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403158854] [2025-03-04 00:09:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:09:05,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:09:05,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:07,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:07,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403158854] [2025-03-04 00:09:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403158854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650438413] [2025-03-04 00:09:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:07,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:07,160 INFO L87 Difference]: Start difference. First operand 1195 states and 1849 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:08,033 INFO L93 Difference]: Finished difference Result 3134 states and 4825 transitions. [2025-03-04 00:09:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:09:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-03-04 00:09:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,045 INFO L225 Difference]: With dead ends: 3134 [2025-03-04 00:09:08,045 INFO L226 Difference]: Without dead ends: 1942 [2025-03-04 00:09:08,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:08,050 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 606 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1111 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:09:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-03-04 00:09:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1681. [2025-03-04 00:09:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1365 states have (on average 1.4527472527472527) internal successors, (1983), 1372 states have internal predecessors, (1983), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-04 00:09:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2565 transitions. [2025-03-04 00:09:08,148 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2565 transitions. Word has length 333 [2025-03-04 00:09:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2565 transitions. [2025-03-04 00:09:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2565 transitions. [2025-03-04 00:09:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:09:08,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:08,152 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:09:08,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -603758950, now seen corresponding path program 1 times [2025-03-04 00:09:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857478064] [2025-03-04 00:09:08,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:08,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:09:08,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:09:08,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:08,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857478064] [2025-03-04 00:09:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857478064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:08,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:08,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804910039] [2025-03-04 00:09:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:08,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:08,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:08,254 INFO L87 Difference]: Start difference. First operand 1681 states and 2565 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:08,373 INFO L93 Difference]: Finished difference Result 4169 states and 6358 transitions. [2025-03-04 00:09:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-03-04 00:09:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,386 INFO L225 Difference]: With dead ends: 4169 [2025-03-04 00:09:08,386 INFO L226 Difference]: Without dead ends: 2612 [2025-03-04 00:09:08,389 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-04 00:09:08,390 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 120 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 564 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-03-04 00:09:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2533. [2025-03-04 00:09:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2217 states have (on average 1.4682002706359947) internal successors, (3255), 2224 states have internal predecessors, (3255), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-04 00:09:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3837 transitions. [2025-03-04 00:09:08,517 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3837 transitions. Word has length 333 [2025-03-04 00:09:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3837 transitions. [2025-03-04 00:09:08,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3837 transitions. [2025-03-04 00:09:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:09:08,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:08,521 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:09:08,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1121721947, now seen corresponding path program 1 times [2025-03-04 00:09:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112940878] [2025-03-04 00:09:08,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:09:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:09:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112940878] [2025-03-04 00:09:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112940878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:08,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934928890] [2025-03-04 00:09:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:08,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:08,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:08,620 INFO L87 Difference]: Start difference. First operand 2533 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:08,741 INFO L93 Difference]: Finished difference Result 4882 states and 7393 transitions. [2025-03-04 00:09:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-03-04 00:09:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,755 INFO L225 Difference]: With dead ends: 4882 [2025-03-04 00:09:08,756 INFO L226 Difference]: Without dead ends: 2732 [2025-03-04 00:09:08,761 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-04 00:09:08,762 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 99 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 604 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-04 00:09:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2653. [2025-03-04 00:09:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2337 states have (on average 1.4565682498930252) internal successors, (3404), 2344 states have internal predecessors, (3404), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-04 00:09:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3986 transitions. [2025-03-04 00:09:08,874 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3986 transitions. Word has length 333 [2025-03-04 00:09:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:08,875 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 3986 transitions. [2025-03-04 00:09:08,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3986 transitions. [2025-03-04 00:09:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 00:09:08,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:08,878 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:08,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:09:08,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:08,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1557047041, now seen corresponding path program 1 times [2025-03-04 00:09:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757902406] [2025-03-04 00:09:08,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:08,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-04 00:09:08,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 00:09:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757902406] [2025-03-04 00:09:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757902406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:09,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055706698] [2025-03-04 00:09:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:09,042 INFO L87 Difference]: Start difference. First operand 2653 states and 3986 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:09,210 INFO L93 Difference]: Finished difference Result 4878 states and 7314 transitions. [2025-03-04 00:09:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:09,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 333 [2025-03-04 00:09:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:09,221 INFO L225 Difference]: With dead ends: 4878 [2025-03-04 00:09:09,221 INFO L226 Difference]: Without dead ends: 2714 [2025-03-04 00:09:09,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:09,227 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 112 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:09,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 997 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2025-03-04 00:09:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2635. [2025-03-04 00:09:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2319 states have (on average 1.4523501509271237) internal successors, (3368), 2326 states have internal predecessors, (3368), 291 states have call successors, (291), 24 states have call predecessors, (291), 24 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-04 00:09:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3950 transitions. [2025-03-04 00:09:09,339 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3950 transitions. Word has length 333 [2025-03-04 00:09:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:09,339 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3950 transitions. [2025-03-04 00:09:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3950 transitions. [2025-03-04 00:09:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:09,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:09,342 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:09,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:09:09,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:09,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1984232671, now seen corresponding path program 1 times [2025-03-04 00:09:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:09,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612399421] [2025-03-04 00:09:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:09,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:09,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:09,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612399421] [2025-03-04 00:09:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612399421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:09:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73707087] [2025-03-04 00:09:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:09:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:10,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:09:10,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:09:10,667 INFO L87 Difference]: Start difference. First operand 2635 states and 3950 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:12,040 INFO L93 Difference]: Finished difference Result 6797 states and 10192 transitions. [2025-03-04 00:09:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:09:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-03-04 00:09:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:12,062 INFO L225 Difference]: With dead ends: 6797 [2025-03-04 00:09:12,062 INFO L226 Difference]: Without dead ends: 5782 [2025-03-04 00:09:12,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:09:12,068 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 775 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:12,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1421 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:09:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2025-03-04 00:09:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5026. [2025-03-04 00:09:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 4446 states have (on average 1.4507422402159245) internal successors, (6450), 4460 states have internal predecessors, (6450), 533 states have call successors, (533), 46 states have call predecessors, (533), 46 states have return successors, (533), 519 states have call predecessors, (533), 533 states have call successors, (533) [2025-03-04 00:09:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 7516 transitions. [2025-03-04 00:09:12,290 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 7516 transitions. Word has length 334 [2025-03-04 00:09:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 5026 states and 7516 transitions. [2025-03-04 00:09:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 7516 transitions. [2025-03-04 00:09:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:12,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:12,296 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:12,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:09:12,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1800200448, now seen corresponding path program 1 times [2025-03-04 00:09:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870763] [2025-03-04 00:09:12,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:13,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:13,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870763] [2025-03-04 00:09:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130870763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 00:09:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910520504] [2025-03-04 00:09:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:18,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:09:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:18,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:09:18,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:09:18,203 INFO L87 Difference]: Start difference. First operand 5026 states and 7516 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 00:09:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:22,662 INFO L93 Difference]: Finished difference Result 8923 states and 13413 transitions. [2025-03-04 00:09:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:09:22,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 334 [2025-03-04 00:09:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:22,724 INFO L225 Difference]: With dead ends: 8923 [2025-03-04 00:09:22,725 INFO L226 Difference]: Without dead ends: 7726 [2025-03-04 00:09:22,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:09:22,737 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2106 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:22,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2106 Valid, 2187 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 00:09:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2025-03-04 00:09:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 5365. [2025-03-04 00:09:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4785 states have (on average 1.4549634273772205) internal successors, (6962), 4799 states have internal predecessors, (6962), 533 states have call successors, (533), 46 states have call predecessors, (533), 46 states have return successors, (533), 519 states have call predecessors, (533), 533 states have call successors, (533) [2025-03-04 00:09:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 8028 transitions. [2025-03-04 00:09:23,102 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 8028 transitions. Word has length 334 [2025-03-04 00:09:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 8028 transitions. [2025-03-04 00:09:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-03-04 00:09:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 8028 transitions. [2025-03-04 00:09:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:23,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:23,112 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:09:23,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash -545744540, now seen corresponding path program 1 times [2025-03-04 00:09:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158096732] [2025-03-04 00:09:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:23,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:23,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:23,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158096732] [2025-03-04 00:09:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158096732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:09:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528913948] [2025-03-04 00:09:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:28,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:09:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:28,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:09:28,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:09:28,173 INFO L87 Difference]: Start difference. First operand 5365 states and 8028 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:09:37,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:09:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:44,227 INFO L93 Difference]: Finished difference Result 18676 states and 27406 transitions. [2025-03-04 00:09:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:09:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-03-04 00:09:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:44,264 INFO L225 Difference]: With dead ends: 18676 [2025-03-04 00:09:44,264 INFO L226 Difference]: Without dead ends: 15453 [2025-03-04 00:09:44,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:09:44,274 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1755 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:44,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 3485 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-03-04 00:09:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2025-03-04 00:09:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 10499. [2025-03-04 00:09:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 9627 states have (on average 1.4568401371143658) internal successors, (14025), 9662 states have internal predecessors, (14025), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-04 00:09:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 15577 transitions. [2025-03-04 00:09:44,832 INFO L78 Accepts]: Start accepts. Automaton has 10499 states and 15577 transitions. Word has length 334 [2025-03-04 00:09:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:44,833 INFO L471 AbstractCegarLoop]: Abstraction has 10499 states and 15577 transitions. [2025-03-04 00:09:44,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:09:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10499 states and 15577 transitions. [2025-03-04 00:09:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:44,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:44,842 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:09:44,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -351428672, now seen corresponding path program 1 times [2025-03-04 00:09:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890568402] [2025-03-04 00:09:44,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:44,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:45,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:45,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890568402] [2025-03-04 00:09:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890568402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:09:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625727416] [2025-03-04 00:09:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:09:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:45,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:09:45,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:09:45,555 INFO L87 Difference]: Start difference. First operand 10499 states and 15577 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:09:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:46,418 INFO L93 Difference]: Finished difference Result 17124 states and 25569 transitions. [2025-03-04 00:09:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:09:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-03-04 00:09:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:46,448 INFO L225 Difference]: With dead ends: 17124 [2025-03-04 00:09:46,449 INFO L226 Difference]: Without dead ends: 10524 [2025-03-04 00:09:46,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:46,462 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 669 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:46,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1478 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:09:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10524 states. [2025-03-04 00:09:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10524 to 10513. [2025-03-04 00:09:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 9641 states have (on average 1.456176745150918) internal successors, (14039), 9676 states have internal predecessors, (14039), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-04 00:09:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 15591 transitions. [2025-03-04 00:09:46,951 INFO L78 Accepts]: Start accepts. Automaton has 10513 states and 15591 transitions. Word has length 334 [2025-03-04 00:09:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:46,952 INFO L471 AbstractCegarLoop]: Abstraction has 10513 states and 15591 transitions. [2025-03-04 00:09:46,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:09:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10513 states and 15591 transitions. [2025-03-04 00:09:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:46,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:46,961 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:09:46,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -861962849, now seen corresponding path program 1 times [2025-03-04 00:09:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024936316] [2025-03-04 00:09:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:46,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:47,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:47,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:47,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024936316] [2025-03-04 00:09:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024936316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:50,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:50,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 00:09:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615277571] [2025-03-04 00:09:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:50,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:09:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:50,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:09:50,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:09:50,225 INFO L87 Difference]: Start difference. First operand 10513 states and 15591 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:54,899 INFO L93 Difference]: Finished difference Result 30007 states and 44547 transitions. [2025-03-04 00:09:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:09:54,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-03-04 00:09:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:54,936 INFO L225 Difference]: With dead ends: 30007 [2025-03-04 00:09:54,936 INFO L226 Difference]: Without dead ends: 22182 [2025-03-04 00:09:54,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:09:54,947 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1884 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:54,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 2554 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 00:09:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22182 states. [2025-03-04 00:09:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22182 to 11948. [2025-03-04 00:09:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11948 states, 11076 states have (on average 1.4687612856626941) internal successors, (16268), 11111 states have internal predecessors, (16268), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-04 00:09:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 17820 transitions. [2025-03-04 00:09:55,462 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 17820 transitions. Word has length 334 [2025-03-04 00:09:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:55,463 INFO L471 AbstractCegarLoop]: Abstraction has 11948 states and 17820 transitions. [2025-03-04 00:09:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:09:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 17820 transitions. [2025-03-04 00:09:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:09:55,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:55,472 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:09:55,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -740091894, now seen corresponding path program 1 times [2025-03-04 00:09:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348806348] [2025-03-04 00:09:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:09:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:09:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:09:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348806348] [2025-03-04 00:09:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348806348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:09:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63820649] [2025-03-04 00:09:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:09:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:57,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:09:57,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:57,205 INFO L87 Difference]: Start difference. First operand 11948 states and 17820 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:09:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:59,485 INFO L93 Difference]: Finished difference Result 24105 states and 35801 transitions. [2025-03-04 00:09:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:09:59,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 334 [2025-03-04 00:09:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:59,514 INFO L225 Difference]: With dead ends: 24105 [2025-03-04 00:09:59,514 INFO L226 Difference]: Without dead ends: 15679 [2025-03-04 00:09:59,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:09:59,527 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1371 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 3026 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:09:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2025-03-04 00:10:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 11532. [2025-03-04 00:10:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11532 states, 10660 states have (on average 1.4688555347091932) internal successors, (15658), 10695 states have internal predecessors, (15658), 776 states have call successors, (776), 95 states have call predecessors, (776), 95 states have return successors, (776), 741 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-04 00:10:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11532 states to 11532 states and 17210 transitions. [2025-03-04 00:10:00,076 INFO L78 Accepts]: Start accepts. Automaton has 11532 states and 17210 transitions. Word has length 334 [2025-03-04 00:10:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:00,077 INFO L471 AbstractCegarLoop]: Abstraction has 11532 states and 17210 transitions. [2025-03-04 00:10:00,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:10:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11532 states and 17210 transitions. [2025-03-04 00:10:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:10:00,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:00,084 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:00,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:10:00,084 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:00,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -553503899, now seen corresponding path program 1 times [2025-03-04 00:10:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971266685] [2025-03-04 00:10:00,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:10:00,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:10:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:10:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971266685] [2025-03-04 00:10:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971266685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321793095] [2025-03-04 00:10:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:00,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:00,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:00,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:00,372 INFO L87 Difference]: Start difference. First operand 11532 states and 17210 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:10:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:01,067 INFO L93 Difference]: Finished difference Result 23290 states and 34805 transitions. [2025-03-04 00:10:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:10:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-03-04 00:10:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:01,095 INFO L225 Difference]: With dead ends: 23290 [2025-03-04 00:10:01,096 INFO L226 Difference]: Without dead ends: 12852 [2025-03-04 00:10:01,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:10:01,110 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 204 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1023 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2025-03-04 00:10:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11076. [2025-03-04 00:10:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11076 states, 10214 states have (on average 1.4686704523203447) internal successors, (15001), 10247 states have internal predecessors, (15001), 768 states have call successors, (768), 93 states have call predecessors, (768), 93 states have return successors, (768), 735 states have call predecessors, (768), 768 states have call successors, (768) [2025-03-04 00:10:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 16537 transitions. [2025-03-04 00:10:01,854 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 16537 transitions. Word has length 334 [2025-03-04 00:10:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:01,854 INFO L471 AbstractCegarLoop]: Abstraction has 11076 states and 16537 transitions. [2025-03-04 00:10:01,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:10:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 16537 transitions. [2025-03-04 00:10:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:10:01,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:01,860 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:01,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:10:01,860 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1361576255, now seen corresponding path program 1 times [2025-03-04 00:10:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526138832] [2025-03-04 00:10:01,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:10:01,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:10:01,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:10:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526138832] [2025-03-04 00:10:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526138832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230138157] [2025-03-04 00:10:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:02,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:02,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:02,038 INFO L87 Difference]: Start difference. First operand 11076 states and 16537 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:10:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:02,781 INFO L93 Difference]: Finished difference Result 20513 states and 30816 transitions. [2025-03-04 00:10:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 334 [2025-03-04 00:10:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:02,812 INFO L225 Difference]: With dead ends: 20513 [2025-03-04 00:10:02,812 INFO L226 Difference]: Without dead ends: 14994 [2025-03-04 00:10:02,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:02,824 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 305 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:02,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 963 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14994 states. [2025-03-04 00:10:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14994 to 14968. [2025-03-04 00:10:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14968 states, 13712 states have (on average 1.462514585764294) internal successors, (20054), 13758 states have internal predecessors, (20054), 1124 states have call successors, (1124), 131 states have call predecessors, (1124), 131 states have return successors, (1124), 1078 states have call predecessors, (1124), 1124 states have call successors, (1124) [2025-03-04 00:10:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14968 states to 14968 states and 22302 transitions. [2025-03-04 00:10:03,466 INFO L78 Accepts]: Start accepts. Automaton has 14968 states and 22302 transitions. Word has length 334 [2025-03-04 00:10:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:03,467 INFO L471 AbstractCegarLoop]: Abstraction has 14968 states and 22302 transitions. [2025-03-04 00:10:03,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:10:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 14968 states and 22302 transitions. [2025-03-04 00:10:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 00:10:03,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:03,475 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 00:10:03,476 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -677766042, now seen corresponding path program 1 times [2025-03-04 00:10:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637221149] [2025-03-04 00:10:03,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 00:10:03,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 00:10:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat