./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.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_amount250_file-53.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 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:19:01,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:19:01,642 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:19:01,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:19:01,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:19:01,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:19:01,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:19:01,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:19:01,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:19:01,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:19:01,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:19:01,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:19:01,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:19:01,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:19:01,665 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:19:01,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:19:01,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:19:01,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:19:01,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:19:01,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:01,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:19:01,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:19:01,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:19:01,668 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 -> 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 [2025-02-06 02:19:01,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:19:01,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:19:01,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:19:01,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:19:01,894 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:19:01,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i [2025-02-06 02:19:03,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1de3f3ec1/5a06241cd12840388559e96c1aa5752a/FLAG204dd2b78 [2025-02-06 02:19:03,380 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:19:03,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i [2025-02-06 02:19:03,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1de3f3ec1/5a06241cd12840388559e96c1aa5752a/FLAG204dd2b78 [2025-02-06 02:19:03,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1de3f3ec1/5a06241cd12840388559e96c1aa5752a [2025-02-06 02:19:03,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:19:03,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:19:03,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:03,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:19:03,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:19:03,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2385ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03, skipping insertion in model container [2025-02-06 02:19:03,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:19:03,555 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_amount250_file-53.i[916,929] [2025-02-06 02:19:03,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:03,713 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:19:03,720 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_amount250_file-53.i[916,929] [2025-02-06 02:19:03,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:03,809 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:19:03,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03 WrapperNode [2025-02-06 02:19:03,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:03,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:03,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:19:03,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:19:03,822 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:19:03" (1/1) ... [2025-02-06 02:19:03,837 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:19:03" (1/1) ... [2025-02-06 02:19:03,892 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-02-06 02:19:03,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:03,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:19:03,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:19:03,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:19:03,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,950 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:19:03,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:19:03,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:19:03,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:19:03,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:19:03,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (1/1) ... [2025-02-06 02:19:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:04,019 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:19:04,026 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:19:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:19:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:19:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:19:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:19:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:19:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:19:04,166 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:19:04,167 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:19:04,813 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc property_#t~ite36#1;havoc property_#t~bitwise35#1;havoc property_#t~short37#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short40#1; [2025-02-06 02:19:04,869 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-06 02:19:04,869 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:19:04,885 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:19:04,887 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:19:04,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:04 BoogieIcfgContainer [2025-02-06 02:19:04,888 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:19:04,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:19:04,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:19:04,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:19:04,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:19:03" (1/3) ... [2025-02-06 02:19:04,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:04, skipping insertion in model container [2025-02-06 02:19:04,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:03" (2/3) ... [2025-02-06 02:19:04,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:04, skipping insertion in model container [2025-02-06 02:19:04,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:04" (3/3) ... [2025-02-06 02:19:04,895 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-53.i [2025-02-06 02:19:04,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:19:04,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-53.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:19:04,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:19:04,968 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;@6e9c571e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:19:04,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:19:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:19:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:04,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:04,991 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:04,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 209240578, now seen corresponding path program 1 times [2025-02-06 02:19:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:05,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923818328] [2025-02-06 02:19:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:05,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:05,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:05,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-02-06 02:19:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923818328] [2025-02-06 02:19:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923818328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:05,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618156212] [2025-02-06 02:19:05,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:05,452 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:19:05,453 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:19:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:05,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:05,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:05,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:05,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:19:05,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-02-06 02:19:05,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:19:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618156212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:19:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:19:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823765053] [2025-02-06 02:19:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:19:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:05,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:19:05,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:05,782 INFO L87 Difference]: Start difference. First operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:19:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:05,813 INFO L93 Difference]: Finished difference Result 328 states and 570 transitions. [2025-02-06 02:19:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:19:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 305 [2025-02-06 02:19:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:05,820 INFO L225 Difference]: With dead ends: 328 [2025-02-06 02:19:05,820 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 02:19:05,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 306 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:19:05,826 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:05,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 02:19:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 02:19:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:19:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2025-02-06 02:19:05,866 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 305 [2025-02-06 02:19:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:05,866 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2025-02-06 02:19:05,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:19:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2025-02-06 02:19:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:05,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:05,879 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:19:06,079 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:19:06,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1217101885, now seen corresponding path program 1 times [2025-02-06 02:19:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:06,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439250493] [2025-02-06 02:19:06,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:06,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:06,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:06,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:06,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439250493] [2025-02-06 02:19:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439250493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024048666] [2025-02-06 02:19:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:06,411 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:06,507 INFO L93 Difference]: Finished difference Result 472 states and 745 transitions. [2025-02-06 02:19:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-02-06 02:19:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:06,512 INFO L225 Difference]: With dead ends: 472 [2025-02-06 02:19:06,513 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 02:19:06,515 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:19:06,517 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 233 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:06,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 693 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 02:19:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 182. [2025-02-06 02:19:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 135 states have (on average 1.451851851851852) internal successors, (196), 135 states have internal predecessors, (196), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:19:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 286 transitions. [2025-02-06 02:19:06,541 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 286 transitions. Word has length 305 [2025-02-06 02:19:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:06,543 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 286 transitions. [2025-02-06 02:19:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2025-02-06 02:19:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:06,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:06,547 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:19:06,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:06,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash 246517314, now seen corresponding path program 1 times [2025-02-06 02:19:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404954731] [2025-02-06 02:19:06,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:06,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:06,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404954731] [2025-02-06 02:19:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404954731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555366368] [2025-02-06 02:19:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:07,146 INFO L87 Difference]: Start difference. First operand 182 states and 286 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:07,484 INFO L93 Difference]: Finished difference Result 482 states and 754 transitions. [2025-02-06 02:19:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-02-06 02:19:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:07,488 INFO L225 Difference]: With dead ends: 482 [2025-02-06 02:19:07,490 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 02:19:07,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:07,491 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 179 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:07,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1270 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 02:19:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 186. [2025-02-06 02:19:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 139 states have internal predecessors, (200), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:19:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2025-02-06 02:19:07,516 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 305 [2025-02-06 02:19:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:07,516 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2025-02-06 02:19:07,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2025-02-06 02:19:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:07,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:07,520 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:19:07,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1550434045, now seen corresponding path program 1 times [2025-02-06 02:19:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-02-06 02:19:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:07,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:07,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:07,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:08,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:08,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-02-06 02:19:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15473360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:08,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:08,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:19:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729186431] [2025-02-06 02:19:08,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:19:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:08,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:19:08,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:19:08,902 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:19:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:09,601 INFO L93 Difference]: Finished difference Result 661 states and 1033 transitions. [2025-02-06 02:19:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:19:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 305 [2025-02-06 02:19:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:09,607 INFO L225 Difference]: With dead ends: 661 [2025-02-06 02:19:09,607 INFO L226 Difference]: Without dead ends: 478 [2025-02-06 02:19:09,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:19:09,608 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 586 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:09,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1042 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:19:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-06 02:19:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 299. [2025-02-06 02:19:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 206 states have (on average 1.4077669902912622) internal successors, (290), 206 states have internal predecessors, (290), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:19:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 470 transitions. [2025-02-06 02:19:09,652 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 470 transitions. Word has length 305 [2025-02-06 02:19:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 470 transitions. [2025-02-06 02:19:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:19:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 470 transitions. [2025-02-06 02:19:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:09,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:09,658 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:19:09,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash 706476962, now seen corresponding path program 1 times [2025-02-06 02:19:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439490674] [2025-02-06 02:19:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:09,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:10,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439490674] [2025-02-06 02:19:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439490674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654279503] [2025-02-06 02:19:10,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:10,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:10,463 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:19:10,465 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:19:10,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:10,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:10,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:10,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:10,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:19:10,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1836 proven. 132 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-02-06 02:19:11,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654279503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:12,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:12,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 02:19:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274421089] [2025-02-06 02:19:12,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:19:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:12,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:19:12,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:19:12,394 INFO L87 Difference]: Start difference. First operand 299 states and 470 transitions. Second operand has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) [2025-02-06 02:19:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:12,986 INFO L93 Difference]: Finished difference Result 692 states and 1059 transitions. [2025-02-06 02:19:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:19:12,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) Word has length 305 [2025-02-06 02:19:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:12,991 INFO L225 Difference]: With dead ends: 692 [2025-02-06 02:19:12,991 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 02:19:12,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 605 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:19:12,992 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 875 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:12,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 787 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 02:19:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 317. [2025-02-06 02:19:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 220 states have internal predecessors, (304), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:19:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 484 transitions. [2025-02-06 02:19:13,025 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 484 transitions. Word has length 305 [2025-02-06 02:19:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:13,026 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 484 transitions. [2025-02-06 02:19:13,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) [2025-02-06 02:19:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 484 transitions. [2025-02-06 02:19:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:13,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:13,030 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:13,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:13,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:13,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1399578659, now seen corresponding path program 1 times [2025-02-06 02:19:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711261963] [2025-02-06 02:19:13,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:13,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:14,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711261963] [2025-02-06 02:19:14,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711261963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545290469] [2025-02-06 02:19:14,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:14,495 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19:14,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:19:14,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:14,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:19:14,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1518 proven. 99 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2025-02-06 02:19:15,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545290469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:15,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:19:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83069145] [2025-02-06 02:19:15,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:15,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:19:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:15,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:19:15,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:19:15,391 INFO L87 Difference]: Start difference. First operand 317 states and 484 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-02-06 02:19:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:15,705 INFO L93 Difference]: Finished difference Result 544 states and 823 transitions. [2025-02-06 02:19:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:19:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) Word has length 305 [2025-02-06 02:19:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:15,708 INFO L225 Difference]: With dead ends: 544 [2025-02-06 02:19:15,708 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 02:19:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:19:15,712 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 270 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:15,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 496 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 02:19:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 325. [2025-02-06 02:19:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 226 states have (on average 1.3628318584070795) internal successors, (308), 226 states have internal predecessors, (308), 90 states have call successors, (90), 8 states have call predecessors, (90), 8 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:19:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2025-02-06 02:19:15,742 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 305 [2025-02-06 02:19:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2025-02-06 02:19:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-02-06 02:19:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2025-02-06 02:19:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:15,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:15,746 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:15,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:15,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:15,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:15,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1729344420, now seen corresponding path program 1 times [2025-02-06 02:19:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903883061] [2025-02-06 02:19:15,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:15,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:16,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:16,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:16,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903883061] [2025-02-06 02:19:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903883061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329862399] [2025-02-06 02:19:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:16,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:16,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:16,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:16,434 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:16,762 INFO L93 Difference]: Finished difference Result 614 states and 924 transitions. [2025-02-06 02:19:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-02-06 02:19:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:16,765 INFO L225 Difference]: With dead ends: 614 [2025-02-06 02:19:16,765 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 02:19:16,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:19:16,768 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 303 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:16,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 894 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 02:19:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 311. [2025-02-06 02:19:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.3317535545023698) internal successors, (281), 211 states have internal predecessors, (281), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:19:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 461 transitions. [2025-02-06 02:19:16,801 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 461 transitions. Word has length 305 [2025-02-06 02:19:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 461 transitions. [2025-02-06 02:19:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 461 transitions. [2025-02-06 02:19:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-06 02:19:16,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:16,806 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:16,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:19:16,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1422733668, now seen corresponding path program 1 times [2025-02-06 02:19:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355190010] [2025-02-06 02:19:16,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:17,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:17,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:17,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:17,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355190010] [2025-02-06 02:19:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355190010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691188736] [2025-02-06 02:19:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:17,415 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:17,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:19:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-06 02:19:17,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-06 02:19:17,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:17,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:17,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:19:17,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1892 proven. 48 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2025-02-06 02:19:17,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 84 proven. 48 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691188736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:17,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:17,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 02:19:17,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740024074] [2025-02-06 02:19:17,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:19:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:17,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:19:17,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:19:17,951 INFO L87 Difference]: Start difference. First operand 311 states and 461 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-02-06 02:19:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:18,422 INFO L93 Difference]: Finished difference Result 544 states and 798 transitions. [2025-02-06 02:19:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:19:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) Word has length 305 [2025-02-06 02:19:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:18,424 INFO L225 Difference]: With dead ends: 544 [2025-02-06 02:19:18,424 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 02:19:18,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:19:18,425 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 715 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:18,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 444 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:19:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 02:19:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2025-02-06 02:19:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 222 states have internal predecessors, (286), 90 states have call successors, (90), 13 states have call predecessors, (90), 13 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:19:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 466 transitions. [2025-02-06 02:19:18,462 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 466 transitions. Word has length 305 [2025-02-06 02:19:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 466 transitions. [2025-02-06 02:19:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-02-06 02:19:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 466 transitions. [2025-02-06 02:19:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-06 02:19:18,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:18,466 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:18,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:19:18,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 02:19:18,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1309871864, now seen corresponding path program 1 times [2025-02-06 02:19:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140987419] [2025-02-06 02:19:18,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:18,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:19:18,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:19:18,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140987419] [2025-02-06 02:19:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140987419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:19,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128430240] [2025-02-06 02:19:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:19,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:19,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:19,006 INFO L87 Difference]: Start difference. First operand 326 states and 466 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:19,284 INFO L93 Difference]: Finished difference Result 816 states and 1185 transitions. [2025-02-06 02:19:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:19,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 307 [2025-02-06 02:19:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:19,290 INFO L225 Difference]: With dead ends: 816 [2025-02-06 02:19:19,290 INFO L226 Difference]: Without dead ends: 599 [2025-02-06 02:19:19,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:19:19,291 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 284 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:19,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 958 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:19:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-06 02:19:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 527. [2025-02-06 02:19:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 372 states have (on average 1.3172043010752688) internal successors, (490), 372 states have internal predecessors, (490), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-06 02:19:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 760 transitions. [2025-02-06 02:19:19,331 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 760 transitions. Word has length 307 [2025-02-06 02:19:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:19,331 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 760 transitions. [2025-02-06 02:19:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 760 transitions. [2025-02-06 02:19:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-06 02:19:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:19,333 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:19:19,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 661067593, now seen corresponding path program 1 times [2025-02-06 02:19:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735410133] [2025-02-06 02:19:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:19,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:19:19,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:19:19,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:19,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735410133] [2025-02-06 02:19:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735410133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809007506] [2025-02-06 02:19:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:19,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:19,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:19,930 INFO L229 MonitoredProcess]: Starting monitored process 6 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:19:19,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:19:20,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 02:19:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 02:19:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:20,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 02:19:20,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2085 proven. 105 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-02-06 02:19:20,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809007506] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:20,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:20,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 15 [2025-02-06 02:19:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612664183] [2025-02-06 02:19:20,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 02:19:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:20,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 02:19:20,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:19:20,946 INFO L87 Difference]: Start difference. First operand 527 states and 760 transitions. Second operand has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-02-06 02:19:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:23,738 INFO L93 Difference]: Finished difference Result 2997 states and 4155 transitions. [2025-02-06 02:19:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-02-06 02:19:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 307 [2025-02-06 02:19:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:23,748 INFO L225 Difference]: With dead ends: 2997 [2025-02-06 02:19:23,748 INFO L226 Difference]: Without dead ends: 2593 [2025-02-06 02:19:23,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1475, Invalid=5167, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 02:19:23,752 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 911 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:23,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2882 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:19:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2025-02-06 02:19:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 583. [2025-02-06 02:19:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 419 states have (on average 1.2625298329355608) internal successors, (529), 419 states have internal predecessors, (529), 135 states have call successors, (135), 28 states have call predecessors, (135), 28 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-06 02:19:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 799 transitions. [2025-02-06 02:19:23,817 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 799 transitions. Word has length 307 [2025-02-06 02:19:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:23,817 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 799 transitions. [2025-02-06 02:19:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-02-06 02:19:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 799 transitions. [2025-02-06 02:19:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-06 02:19:23,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:23,819 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:24,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 02:19:24,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:24,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1633069544, now seen corresponding path program 1 times [2025-02-06 02:19:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615012368] [2025-02-06 02:19:24,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:24,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-06 02:19:24,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-06 02:19:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615012368] [2025-02-06 02:19:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615012368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:19:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079551566] [2025-02-06 02:19:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:25,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:19:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:25,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:19:25,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:19:25,641 INFO L87 Difference]: Start difference. First operand 583 states and 799 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:26,562 INFO L93 Difference]: Finished difference Result 1609 states and 2239 transitions. [2025-02-06 02:19:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:19:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 308 [2025-02-06 02:19:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:26,568 INFO L225 Difference]: With dead ends: 1609 [2025-02-06 02:19:26,568 INFO L226 Difference]: Without dead ends: 1161 [2025-02-06 02:19:26,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:19:26,569 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 678 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:26,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1596 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:19:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-06 02:19:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 594. [2025-02-06 02:19:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 430 states have (on average 1.2651162790697674) internal successors, (544), 430 states have internal predecessors, (544), 135 states have call successors, (135), 28 states have call predecessors, (135), 28 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-06 02:19:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 814 transitions. [2025-02-06 02:19:26,622 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 814 transitions. Word has length 308 [2025-02-06 02:19:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:26,622 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 814 transitions. [2025-02-06 02:19:26,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 814 transitions. [2025-02-06 02:19:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-06 02:19:26,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:26,624 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:26,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:19:26,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2081766183, now seen corresponding path program 1 times [2025-02-06 02:19:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144273450] [2025-02-06 02:19:26,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:26,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-06 02:19:26,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-06 02:19:26,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:26,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:19:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144273450] [2025-02-06 02:19:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144273450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979540177] [2025-02-06 02:19:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:26,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:26,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:26,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:26,862 INFO L87 Difference]: Start difference. First operand 594 states and 814 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:27,087 INFO L93 Difference]: Finished difference Result 1554 states and 2143 transitions. [2025-02-06 02:19:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 308 [2025-02-06 02:19:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:27,092 INFO L225 Difference]: With dead ends: 1554 [2025-02-06 02:19:27,092 INFO L226 Difference]: Without dead ends: 1100 [2025-02-06 02:19:27,093 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:19:27,094 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 263 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:27,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 745 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-02-06 02:19:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1008. [2025-02-06 02:19:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 736 states have (on average 1.266304347826087) internal successors, (932), 736 states have internal predecessors, (932), 225 states have call successors, (225), 46 states have call predecessors, (225), 46 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-02-06 02:19:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1382 transitions. [2025-02-06 02:19:27,174 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1382 transitions. Word has length 308 [2025-02-06 02:19:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:27,174 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1382 transitions. [2025-02-06 02:19:27,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:19:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1382 transitions. [2025-02-06 02:19:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-06 02:19:27,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:27,176 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:19:27,176 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:27,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash -737513810, now seen corresponding path program 1 times [2025-02-06 02:19:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:27,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735907102] [2025-02-06 02:19:27,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:27,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:27,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-06 02:19:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-06 02:19:27,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735907102] [2025-02-06 02:19:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735907102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154165195] [2025-02-06 02:19:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:27,654 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19:27,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:19:27,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-06 02:19:27,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-06 02:19:27,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:27,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:27,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:19:27,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1934 proven. 51 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2025-02-06 02:19:28,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154165195] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:28,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-02-06 02:19:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321986392] [2025-02-06 02:19:28,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:19:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:28,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:19:28,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:19:28,653 INFO L87 Difference]: Start difference. First operand 1008 states and 1382 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-02-06 02:19:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:29,338 INFO L93 Difference]: Finished difference Result 2089 states and 2854 transitions. [2025-02-06 02:19:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:19:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) Word has length 309 [2025-02-06 02:19:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:29,344 INFO L225 Difference]: With dead ends: 2089 [2025-02-06 02:19:29,344 INFO L226 Difference]: Without dead ends: 1209 [2025-02-06 02:19:29,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:19:29,346 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 513 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:29,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1365 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-02-06 02:19:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1004. [2025-02-06 02:19:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 732 states have (on average 1.25) internal successors, (915), 732 states have internal predecessors, (915), 225 states have call successors, (225), 46 states have call predecessors, (225), 46 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-02-06 02:19:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1365 transitions. [2025-02-06 02:19:29,429 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1365 transitions. Word has length 309 [2025-02-06 02:19:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1365 transitions. [2025-02-06 02:19:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-02-06 02:19:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1365 transitions. [2025-02-06 02:19:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-06 02:19:29,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:29,431 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 02:19:29,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1618987036, now seen corresponding path program 1 times [2025-02-06 02:19:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397362915] [2025-02-06 02:19:29,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:29,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 02:19:29,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 02:19:29,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:29,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 9 proven. 123 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:33,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397362915] [2025-02-06 02:19:33,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397362915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626810818] [2025-02-06 02:19:33,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:33,774 INFO L229 MonitoredProcess]: Starting monitored process 8 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:19:33,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 02:19:33,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 02:19:34,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 02:19:34,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:34,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:34,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 02:19:34,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1359 proven. 204 refuted. 0 times theorem prover too weak. 2397 trivial. 0 not checked. [2025-02-06 02:19:35,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 27 proven. 105 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:19:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626810818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:35,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 30 [2025-02-06 02:19:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220206809] [2025-02-06 02:19:35,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 02:19:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 02:19:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-02-06 02:19:35,951 INFO L87 Difference]: Start difference. First operand 1004 states and 1365 transitions. Second operand has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) [2025-02-06 02:19:46,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:19:50,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:19:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:57,706 INFO L93 Difference]: Finished difference Result 5480 states and 7297 transitions. [2025-02-06 02:19:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-02-06 02:19:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) Word has length 310 [2025-02-06 02:19:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:57,720 INFO L225 Difference]: With dead ends: 5480 [2025-02-06 02:19:57,720 INFO L226 Difference]: Without dead ends: 4616 [2025-02-06 02:19:57,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2427, Invalid=9345, Unknown=0, NotChecked=0, Total=11772 [2025-02-06 02:19:57,725 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 4061 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 4515 mSolverCounterSat, 611 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4061 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 4515 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:57,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4061 Valid, 2760 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 4515 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2025-02-06 02:19:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4616 states. [2025-02-06 02:19:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4616 to 3318. [2025-02-06 02:19:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2719 states have (on average 1.2997425524089739) internal successors, (3534), 2731 states have internal predecessors, (3534), 457 states have call successors, (457), 141 states have call predecessors, (457), 141 states have return successors, (457), 445 states have call predecessors, (457), 457 states have call successors, (457) [2025-02-06 02:19:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4448 transitions. [2025-02-06 02:19:58,034 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4448 transitions. Word has length 310 [2025-02-06 02:19:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:58,035 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4448 transitions. [2025-02-06 02:19:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) [2025-02-06 02:19:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4448 transitions. [2025-02-06 02:19:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-06 02:19:58,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:58,037 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:58,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:58,238 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash -265677339, now seen corresponding path program 1 times [2025-02-06 02:19:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53240244] [2025-02-06 02:19:58,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 02:19:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 02:19:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 150 proven. 342 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked. [2025-02-06 02:20:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53240244] [2025-02-06 02:20:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53240244] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219237081] [2025-02-06 02:20:21,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:21,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:21,806 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:21,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 02:20:21,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 02:20:22,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 02:20:22,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:22,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:22,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 02:20:22,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2093 proven. 318 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-02-06 02:20:24,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 60 proven. 327 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2025-02-06 02:20:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219237081] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:26,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 39 [2025-02-06 02:20:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709454786] [2025-02-06 02:20:26,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:26,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 02:20:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:26,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 02:20:26,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 02:20:26,153 INFO L87 Difference]: Start difference. First operand 3318 states and 4448 transitions. Second operand has 39 states, 37 states have (on average 6.45945945945946) internal successors, (239), 38 states have internal predecessors, (239), 15 states have call successors, (134), 5 states have call predecessors, (134), 11 states have return successors, (135), 14 states have call predecessors, (135), 15 states have call successors, (135)