./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6d1b006d272058898ce4b6d9ba4b6ecf31d1f20c483932c07245be2ad6eb978b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:47,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:47,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:41:47,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:47,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:47,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:47,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:47,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:47,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:47,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:47,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:47,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:47,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:47,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:47,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:47,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:47,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:47,352 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-jdk21/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 -> 6d1b006d272058898ce4b6d9ba4b6ecf31d1f20c483932c07245be2ad6eb978b [2025-02-06 02:41:47,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:47,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:47,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:47,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:47,621 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:47,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i [2025-02-06 02:41:48,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c80700fd/8d850cfac9224b37bffed86e414f53f6/FLAG3fdd69083 [2025-02-06 02:41:49,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:49,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i [2025-02-06 02:41:49,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c80700fd/8d850cfac9224b37bffed86e414f53f6/FLAG3fdd69083 [2025-02-06 02:41:49,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c80700fd/8d850cfac9224b37bffed86e414f53f6 [2025-02-06 02:41:49,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:49,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:49,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:49,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:49,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:49,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49, skipping insertion in model container [2025-02-06 02:41:49,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:49,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i[916,929] [2025-02-06 02:41:49,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:49,695 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:49,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i[916,929] [2025-02-06 02:41:49,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:49,812 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:49,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49 WrapperNode [2025-02-06 02:41:49,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:49,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:49,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:49,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:49,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,919 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 642 [2025-02-06 02:41:49,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:49,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:49,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:49,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:49,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:49,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,019 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-02-06 02:41:50,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:50,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:50,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:50,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:50,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (1/1) ... [2025-02-06 02:41:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:50,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:50,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:41:50,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:41:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:50,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:50,255 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:50,256 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:51,153 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: havoc property_#t~ite45#1;havoc property_#t~bitwise43#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~ite49#1;havoc property_#t~ite48#1;havoc property_#t~bitwise47#1;havoc property_#t~short50#1; [2025-02-06 02:41:51,274 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:51,274 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:51,294 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:51,294 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:41:51,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:51 BoogieIcfgContainer [2025-02-06 02:41:51,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:51,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:51,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:51,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:51,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:49" (1/3) ... [2025-02-06 02:41:51,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6651f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:51, skipping insertion in model container [2025-02-06 02:41:51,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:49" (2/3) ... [2025-02-06 02:41:51,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6651f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:51, skipping insertion in model container [2025-02-06 02:41:51,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:51" (3/3) ... [2025-02-06 02:41:51,301 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-56.i [2025-02-06 02:41:51,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:51,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-56.i that has 2 procedures, 244 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:51,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:51,364 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;@76610380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:51,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 184 states have (on average 1.576086956521739) internal successors, (290), 185 states have internal predecessors, (290), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 02:41:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:41:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:51,383 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:51,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1143021639, now seen corresponding path program 1 times [2025-02-06 02:41:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172717993] [2025-02-06 02:41:51,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:51,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:51,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-02-06 02:41:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172717993] [2025-02-06 02:41:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172717993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359716723] [2025-02-06 02:41:51,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:51,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:51,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:51,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:41:51,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:41:51,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:52,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-02-06 02:41:52,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359716723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347152276] [2025-02-06 02:41:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:52,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:52,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:52,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:52,255 INFO L87 Difference]: Start difference. First operand has 244 states, 184 states have (on average 1.576086956521739) internal successors, (290), 185 states have internal predecessors, (290), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:41:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:52,304 INFO L93 Difference]: Finished difference Result 482 states and 860 transitions. [2025-02-06 02:41:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 406 [2025-02-06 02:41:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:52,317 INFO L225 Difference]: With dead ends: 482 [2025-02-06 02:41:52,324 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 02:41:52,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 407 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-02-06 02:41:52,329 INFO L435 NwaCegarLoop]: 391 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, 391 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-02-06 02:41:52,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 02:41:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-02-06 02:41:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 182 states have (on average 1.554945054945055) internal successors, (283), 182 states have internal predecessors, (283), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 02:41:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 397 transitions. [2025-02-06 02:41:52,389 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 397 transitions. Word has length 406 [2025-02-06 02:41:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:52,389 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 397 transitions. [2025-02-06 02:41:52,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:41:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 397 transitions. [2025-02-06 02:41:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:41:52,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:52,401 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:52,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:41:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:41:52,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 540811288, now seen corresponding path program 1 times [2025-02-06 02:41:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506182182] [2025-02-06 02:41:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:52,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506182182] [2025-02-06 02:41:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506182182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180000127] [2025-02-06 02:41:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:53,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:53,092 INFO L87 Difference]: Start difference. First operand 241 states and 397 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:53,178 INFO L93 Difference]: Finished difference Result 616 states and 1025 transitions. [2025-02-06 02:41:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2025-02-06 02:41:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:53,184 INFO L225 Difference]: With dead ends: 616 [2025-02-06 02:41:53,187 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 02:41:53,188 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-02-06 02:41:53,188 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 212 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:53,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 770 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 02:41:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 267. [2025-02-06 02:41:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 208 states have (on average 1.5721153846153846) internal successors, (327), 208 states have internal predecessors, (327), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 02:41:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2025-02-06 02:41:53,217 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 406 [2025-02-06 02:41:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:53,220 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2025-02-06 02:41:53,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2025-02-06 02:41:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:41:53,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:53,225 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:53,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1389807817, now seen corresponding path program 1 times [2025-02-06 02:41:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017345626] [2025-02-06 02:41:53,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:53,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:53,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:53,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017345626] [2025-02-06 02:41:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017345626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796850173] [2025-02-06 02:41:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:53,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:53,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:53,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:53,555 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:53,661 INFO L93 Difference]: Finished difference Result 698 states and 1157 transitions. [2025-02-06 02:41:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2025-02-06 02:41:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:53,664 INFO L225 Difference]: With dead ends: 698 [2025-02-06 02:41:53,664 INFO L226 Difference]: Without dead ends: 434 [2025-02-06 02:41:53,667 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-02-06 02:41:53,668 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 228 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:53,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 788 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-06 02:41:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2025-02-06 02:41:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 360 states have (on average 1.6055555555555556) internal successors, (578), 361 states have internal predecessors, (578), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 02:41:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 714 transitions. [2025-02-06 02:41:53,697 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 714 transitions. Word has length 406 [2025-02-06 02:41:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 714 transitions. [2025-02-06 02:41:53,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 714 transitions. [2025-02-06 02:41:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:41:53,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:53,702 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:53,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:53,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 774896533, now seen corresponding path program 1 times [2025-02-06 02:41:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057965844] [2025-02-06 02:41:53,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:53,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:53,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:53,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:53,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057965844] [2025-02-06 02:41:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057965844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337835035] [2025-02-06 02:41:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:53,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:53,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:53,983 INFO L87 Difference]: Start difference. First operand 431 states and 714 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:54,102 INFO L93 Difference]: Finished difference Result 1277 states and 2116 transitions. [2025-02-06 02:41:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2025-02-06 02:41:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:54,110 INFO L225 Difference]: With dead ends: 1277 [2025-02-06 02:41:54,112 INFO L226 Difference]: Without dead ends: 849 [2025-02-06 02:41:54,125 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-02-06 02:41:54,128 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 327 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:54,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 969 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-06 02:41:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2025-02-06 02:41:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 706 states have (on average 1.5722379603399435) internal successors, (1110), 708 states have internal predecessors, (1110), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-06 02:41:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1382 transitions. [2025-02-06 02:41:54,195 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1382 transitions. Word has length 406 [2025-02-06 02:41:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1382 transitions. [2025-02-06 02:41:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1382 transitions. [2025-02-06 02:41:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:41:54,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:54,203 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:54,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1018216795, now seen corresponding path program 1 times [2025-02-06 02:41:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584678207] [2025-02-06 02:41:54,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:54,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:41:54,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:41:54,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584678207] [2025-02-06 02:41:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584678207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272658482] [2025-02-06 02:41:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:54,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:54,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:54,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:54,962 INFO L87 Difference]: Start difference. First operand 847 states and 1382 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:41:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:55,293 INFO L93 Difference]: Finished difference Result 2665 states and 4333 transitions. [2025-02-06 02:41:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 406 [2025-02-06 02:41:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:55,301 INFO L225 Difference]: With dead ends: 2665 [2025-02-06 02:41:55,301 INFO L226 Difference]: Without dead ends: 1821 [2025-02-06 02:41:55,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:55,303 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 546 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:55,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1545 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-02-06 02:41:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1689. [2025-02-06 02:41:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1408 states have (on average 1.5724431818181819) internal successors, (2214), 1412 states have internal predecessors, (2214), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 268 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-06 02:41:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2758 transitions. [2025-02-06 02:41:55,400 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2758 transitions. Word has length 406 [2025-02-06 02:41:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:55,401 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2758 transitions. [2025-02-06 02:41:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:41:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2758 transitions. [2025-02-06 02:41:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-06 02:41:55,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:55,406 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:55,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:55,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:55,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1076575798, now seen corresponding path program 1 times [2025-02-06 02:41:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226339629] [2025-02-06 02:41:55,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-06 02:41:55,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-06 02:41:55,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226339629] [2025-02-06 02:41:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226339629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469914455] [2025-02-06 02:41:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:56,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:56,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:56,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:56,029 INFO L87 Difference]: Start difference. First operand 1689 states and 2758 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:56,402 INFO L93 Difference]: Finished difference Result 5779 states and 9471 transitions. [2025-02-06 02:41:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 407 [2025-02-06 02:41:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:56,423 INFO L225 Difference]: With dead ends: 5779 [2025-02-06 02:41:56,423 INFO L226 Difference]: Without dead ends: 4093 [2025-02-06 02:41:56,428 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-02-06 02:41:56,429 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 503 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:56,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1298 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2025-02-06 02:41:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3237. [2025-02-06 02:41:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 2676 states have (on average 1.54559043348281) internal successors, (4136), 2684 states have internal predecessors, (4136), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 536 states have call predecessors, (544), 544 states have call successors, (544) [2025-02-06 02:41:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 5224 transitions. [2025-02-06 02:41:56,648 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 5224 transitions. Word has length 407 [2025-02-06 02:41:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:56,649 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 5224 transitions. [2025-02-06 02:41:56,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 5224 transitions. [2025-02-06 02:41:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:41:56,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:56,654 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:56,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:56,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:56,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1796942811, now seen corresponding path program 1 times [2025-02-06 02:41:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364016423] [2025-02-06 02:41:56,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:56,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:41:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:41:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364016423] [2025-02-06 02:41:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364016423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:57,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445951225] [2025-02-06 02:41:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:57,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:57,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:57,149 INFO L87 Difference]: Start difference. First operand 3237 states and 5224 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:57,270 INFO L93 Difference]: Finished difference Result 6455 states and 10421 transitions. [2025-02-06 02:41:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-02-06 02:41:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:57,288 INFO L225 Difference]: With dead ends: 6455 [2025-02-06 02:41:57,289 INFO L226 Difference]: Without dead ends: 3221 [2025-02-06 02:41:57,296 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-02-06 02:41:57,298 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:57,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2025-02-06 02:41:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2025-02-06 02:41:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2660 states have (on average 1.5398496240601505) internal successors, (4096), 2668 states have internal predecessors, (4096), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 536 states have call predecessors, (544), 544 states have call successors, (544) [2025-02-06 02:41:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 5184 transitions. [2025-02-06 02:41:57,461 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 5184 transitions. Word has length 408 [2025-02-06 02:41:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:57,462 INFO L471 AbstractCegarLoop]: Abstraction has 3221 states and 5184 transitions. [2025-02-06 02:41:57,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 5184 transitions. [2025-02-06 02:41:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:41:57,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:57,466 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:57,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash 543646715, now seen corresponding path program 1 times [2025-02-06 02:41:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784126669] [2025-02-06 02:41:57,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:57,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:41:57,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:41:57,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:57,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:58,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784126669] [2025-02-06 02:41:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784126669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880657529] [2025-02-06 02:41:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:58,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:58,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:58,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:58,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:58,905 INFO L87 Difference]: Start difference. First operand 3221 states and 5184 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:59,361 INFO L93 Difference]: Finished difference Result 9227 states and 14902 transitions. [2025-02-06 02:41:59,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:59,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-02-06 02:41:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:59,390 INFO L225 Difference]: With dead ends: 9227 [2025-02-06 02:41:59,390 INFO L226 Difference]: Without dead ends: 5669 [2025-02-06 02:41:59,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:59,399 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 922 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:59,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1183 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2025-02-06 02:41:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4109. [2025-02-06 02:41:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 3548 states have (on average 1.5732807215332583) internal successors, (5582), 3556 states have internal predecessors, (5582), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 536 states have call predecessors, (544), 544 states have call successors, (544) [2025-02-06 02:41:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 6670 transitions. [2025-02-06 02:41:59,622 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 6670 transitions. Word has length 408 [2025-02-06 02:41:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:59,622 INFO L471 AbstractCegarLoop]: Abstraction has 4109 states and 6670 transitions. [2025-02-06 02:41:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:41:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 6670 transitions. [2025-02-06 02:41:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:41:59,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:59,628 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:59,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:59,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:59,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -501532418, now seen corresponding path program 1 times [2025-02-06 02:41:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:59,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591974604] [2025-02-06 02:41:59,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:59,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:41:59,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:41:59,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:59,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:41:59,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591974604] [2025-02-06 02:41:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591974604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:59,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169432770] [2025-02-06 02:41:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:59,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:59,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:59,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:59,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:59,871 INFO L87 Difference]: Start difference. First operand 4109 states and 6670 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:00,293 INFO L93 Difference]: Finished difference Result 16321 states and 26542 transitions. [2025-02-06 02:42:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-02-06 02:42:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:00,341 INFO L225 Difference]: With dead ends: 16321 [2025-02-06 02:42:00,342 INFO L226 Difference]: Without dead ends: 12215 [2025-02-06 02:42:00,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:00,355 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 778 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1879 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:42:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12215 states. [2025-02-06 02:42:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12215 to 11617. [2025-02-06 02:42:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11617 states, 9936 states have (on average 1.5454911433172303) internal successors, (15356), 9960 states have internal predecessors, (15356), 1632 states have call successors, (1632), 48 states have call predecessors, (1632), 48 states have return successors, (1632), 1608 states have call predecessors, (1632), 1632 states have call successors, (1632) [2025-02-06 02:42:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11617 states to 11617 states and 18620 transitions. [2025-02-06 02:42:00,871 INFO L78 Accepts]: Start accepts. Automaton has 11617 states and 18620 transitions. Word has length 408 [2025-02-06 02:42:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:00,871 INFO L471 AbstractCegarLoop]: Abstraction has 11617 states and 18620 transitions. [2025-02-06 02:42:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11617 states and 18620 transitions. [2025-02-06 02:42:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:00,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:00,880 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:00,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:42:00,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:00,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash -525016510, now seen corresponding path program 1 times [2025-02-06 02:42:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78209164] [2025-02-06 02:42:00,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:00,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:01,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:01,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:01,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:42:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78209164] [2025-02-06 02:42:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78209164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:02,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:02,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:42:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437557057] [2025-02-06 02:42:02,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:02,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:42:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:02,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:42:02,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:42:02,378 INFO L87 Difference]: Start difference. First operand 11617 states and 18620 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:03,877 INFO L93 Difference]: Finished difference Result 53808 states and 86166 transitions. [2025-02-06 02:42:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:42:03,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2025-02-06 02:42:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:03,985 INFO L225 Difference]: With dead ends: 53808 [2025-02-06 02:42:03,985 INFO L226 Difference]: Without dead ends: 42194 [2025-02-06 02:42:04,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:42:04,022 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1617 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:04,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 2920 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:42:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42194 states. [2025-02-06 02:42:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42194 to 33649. [2025-02-06 02:42:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33649 states, 29484 states have (on average 1.5510107176773844) internal successors, (45730), 29592 states have internal predecessors, (45730), 3996 states have call successors, (3996), 168 states have call predecessors, (3996), 168 states have return successors, (3996), 3888 states have call predecessors, (3996), 3996 states have call successors, (3996) [2025-02-06 02:42:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33649 states to 33649 states and 53722 transitions. [2025-02-06 02:42:05,377 INFO L78 Accepts]: Start accepts. Automaton has 33649 states and 53722 transitions. Word has length 409 [2025-02-06 02:42:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:05,378 INFO L471 AbstractCegarLoop]: Abstraction has 33649 states and 53722 transitions. [2025-02-06 02:42:05,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 33649 states and 53722 transitions. [2025-02-06 02:42:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:05,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:05,394 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:42:05,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 595964448, now seen corresponding path program 1 times [2025-02-06 02:42:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449549079] [2025-02-06 02:42:05,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:05,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:05,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:05,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:05,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:42:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449549079] [2025-02-06 02:42:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449549079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:42:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937849156] [2025-02-06 02:42:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:42:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:42:06,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:06,381 INFO L87 Difference]: Start difference. First operand 33649 states and 53722 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:08,569 INFO L93 Difference]: Finished difference Result 104875 states and 166088 transitions. [2025-02-06 02:42:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:08,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2025-02-06 02:42:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:08,815 INFO L225 Difference]: With dead ends: 104875 [2025-02-06 02:42:08,815 INFO L226 Difference]: Without dead ends: 88051 [2025-02-06 02:42:08,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:08,885 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 474 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:08,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1388 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:42:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88051 states. [2025-02-06 02:42:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88051 to 67645. [2025-02-06 02:42:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67645 states, 62232 states have (on average 1.5826905771950122) internal successors, (98494), 62496 states have internal predecessors, (98494), 5088 states have call successors, (5088), 324 states have call predecessors, (5088), 324 states have return successors, (5088), 4824 states have call predecessors, (5088), 5088 states have call successors, (5088) [2025-02-06 02:42:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67645 states to 67645 states and 108670 transitions. [2025-02-06 02:42:10,787 INFO L78 Accepts]: Start accepts. Automaton has 67645 states and 108670 transitions. Word has length 409 [2025-02-06 02:42:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:10,787 INFO L471 AbstractCegarLoop]: Abstraction has 67645 states and 108670 transitions. [2025-02-06 02:42:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 67645 states and 108670 transitions. [2025-02-06 02:42:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:10,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:10,832 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:10,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:42:10,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:10,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 302561441, now seen corresponding path program 1 times [2025-02-06 02:42:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960751872] [2025-02-06 02:42:10,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:10,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:10,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:10,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:10,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:42:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960751872] [2025-02-06 02:42:11,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960751872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:11,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657707063] [2025-02-06 02:42:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:11,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:11,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:11,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:11,598 INFO L87 Difference]: Start difference. First operand 67645 states and 108670 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:13,770 INFO L93 Difference]: Finished difference Result 143247 states and 228883 transitions. [2025-02-06 02:42:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:13,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2025-02-06 02:42:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:13,985 INFO L225 Difference]: With dead ends: 143247 [2025-02-06 02:42:13,985 INFO L226 Difference]: Without dead ends: 75605 [2025-02-06 02:42:14,074 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-02-06 02:42:14,076 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 488 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 831 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:42:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75605 states. [2025-02-06 02:42:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75605 to 63001. [2025-02-06 02:42:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63001 states, 57588 states have (on average 1.575189275543516) internal successors, (90712), 57852 states have internal predecessors, (90712), 5088 states have call successors, (5088), 324 states have call predecessors, (5088), 324 states have return successors, (5088), 4824 states have call predecessors, (5088), 5088 states have call successors, (5088) [2025-02-06 02:42:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63001 states to 63001 states and 100888 transitions. [2025-02-06 02:42:16,097 INFO L78 Accepts]: Start accepts. Automaton has 63001 states and 100888 transitions. Word has length 409 [2025-02-06 02:42:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:16,099 INFO L471 AbstractCegarLoop]: Abstraction has 63001 states and 100888 transitions. [2025-02-06 02:42:16,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 63001 states and 100888 transitions. [2025-02-06 02:42:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:16,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:16,130 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:16,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:42:16,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:16,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1481244895, now seen corresponding path program 1 times [2025-02-06 02:42:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891730017] [2025-02-06 02:42:16,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:16,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:16,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-02-06 02:42:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891730017] [2025-02-06 02:42:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891730017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:42:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839535596] [2025-02-06 02:42:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:17,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:42:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:17,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:42:17,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:42:17,865 INFO L87 Difference]: Start difference. First operand 63001 states and 100888 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:21,509 INFO L93 Difference]: Finished difference Result 244749 states and 394398 transitions. [2025-02-06 02:42:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:42:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2025-02-06 02:42:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:21,815 INFO L225 Difference]: With dead ends: 244749 [2025-02-06 02:42:21,815 INFO L226 Difference]: Without dead ends: 181751 [2025-02-06 02:42:21,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:42:21,908 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 2696 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 2522 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:42:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181751 states. [2025-02-06 02:42:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181751 to 98474. [2025-02-06 02:42:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98474 states, 90124 states have (on average 1.5710354622520084) internal successors, (141588), 90533 states have internal predecessors, (141588), 7761 states have call successors, (7761), 588 states have call predecessors, (7761), 588 states have return successors, (7761), 7352 states have call predecessors, (7761), 7761 states have call successors, (7761) [2025-02-06 02:42:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98474 states to 98474 states and 157110 transitions. [2025-02-06 02:42:25,618 INFO L78 Accepts]: Start accepts. Automaton has 98474 states and 157110 transitions. Word has length 409 [2025-02-06 02:42:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:25,619 INFO L471 AbstractCegarLoop]: Abstraction has 98474 states and 157110 transitions. [2025-02-06 02:42:25,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-02-06 02:42:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 98474 states and 157110 transitions. [2025-02-06 02:42:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:25,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:25,660 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:25,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:42:25,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:25,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:25,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1469928768, now seen corresponding path program 1 times [2025-02-06 02:42:25,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:25,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281837879] [2025-02-06 02:42:25,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:25,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:25,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:26,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:26,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-02-06 02:42:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281837879] [2025-02-06 02:42:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281837879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842186899] [2025-02-06 02:42:27,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:27,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:27,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:42:27,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:27,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:27,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:27,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 02:42:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2318 proven. 129 refuted. 0 times theorem prover too weak. 3937 trivial. 0 not checked. [2025-02-06 02:42:28,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-02-06 02:42:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842186899] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:29,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2025-02-06 02:42:29,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307083732] [2025-02-06 02:42:29,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:42:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:29,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:42:29,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:42:29,038 INFO L87 Difference]: Start difference. First operand 98474 states and 157110 transitions. Second operand has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 5 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 5 states have call predecessors, (158), 5 states have call successors, (158) [2025-02-06 02:42:31,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:42:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:40,701 INFO L93 Difference]: Finished difference Result 463491 states and 739482 transitions. [2025-02-06 02:42:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-06 02:42:40,702 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 5 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 5 states have call predecessors, (158), 5 states have call successors, (158) Word has length 409 [2025-02-06 02:42:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:41,399 INFO L225 Difference]: With dead ends: 463491 [2025-02-06 02:42:41,399 INFO L226 Difference]: Without dead ends: 364966 [2025-02-06 02:42:41,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5010 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2501, Invalid=10839, Unknown=0, NotChecked=0, Total=13340 [2025-02-06 02:42:41,559 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 10582 mSDsluCounter, 7189 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 1262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10619 SdHoareTripleChecker+Valid, 7760 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1262 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:41,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10619 Valid, 7760 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1262 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 02:42:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364966 states. [2025-02-06 02:42:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364966 to 127023. [2025-02-06 02:42:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127023 states, 115801 states have (on average 1.549010803015518) internal successors, (179377), 116341 states have internal predecessors, (179377), 10275 states have call successors, (10275), 946 states have call predecessors, (10275), 946 states have return successors, (10275), 9735 states have call predecessors, (10275), 10275 states have call successors, (10275) [2025-02-06 02:42:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127023 states to 127023 states and 199927 transitions. [2025-02-06 02:42:48,256 INFO L78 Accepts]: Start accepts. Automaton has 127023 states and 199927 transitions. Word has length 409 [2025-02-06 02:42:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:48,257 INFO L471 AbstractCegarLoop]: Abstraction has 127023 states and 199927 transitions. [2025-02-06 02:42:48,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 5 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 5 states have call predecessors, (158), 5 states have call successors, (158) [2025-02-06 02:42:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 127023 states and 199927 transitions. [2025-02-06 02:42:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-06 02:42:48,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:48,323 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:48,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:42:48,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:48,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2074095526, now seen corresponding path program 1 times [2025-02-06 02:42:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550970742] [2025-02-06 02:42:48,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:48,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-06 02:42:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-06 02:42:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat