./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.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_fillercode_fillercodestructure_filler-pr-ci_file-9.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 a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:03:35,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:03:35,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:03:35,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:03:35,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:03:35,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:03:35,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:03:35,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:03:35,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:03:35,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:03:35,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:03:35,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:03:35,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:03:35,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:03:35,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:03:35,997 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:03:35,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:03:35,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:03:35,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:03:35,998 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 -> a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 [2025-02-05 23:03:36,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:03:36,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:03:36,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:03:36,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:03:36,235 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:03:36,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-02-05 23:03:37,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c713f92e/3ba14b2eac8c4bbd846b690f02f01d20/FLAGc4a40476e [2025-02-05 23:03:37,775 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:03:37,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-02-05 23:03:37,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c713f92e/3ba14b2eac8c4bbd846b690f02f01d20/FLAGc4a40476e [2025-02-05 23:03:37,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c713f92e/3ba14b2eac8c4bbd846b690f02f01d20 [2025-02-05 23:03:37,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:03:37,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:03:37,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:03:37,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:03:37,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:03:37,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:03:37" (1/1) ... [2025-02-05 23:03:37,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:37, skipping insertion in model container [2025-02-05 23:03:37,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:03:37" (1/1) ... [2025-02-05 23:03:37,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:03:37,922 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_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-02-05 23:03:37,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:03:37,995 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:03:38,009 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_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-02-05 23:03:38,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:03:38,071 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:03:38,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38 WrapperNode [2025-02-05 23:03:38,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:03:38,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:03:38,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:03:38,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:03:38,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,128 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 23:03:38,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:03:38,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:03:38,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:03:38,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:03:38,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,155 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-05 23:03:38,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:03:38,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:03:38,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:03:38,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:03:38,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (1/1) ... [2025-02-05 23:03:38,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:03:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:03:38,211 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-05 23:03:38,213 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-05 23:03:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:03:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:03:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:03:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:03:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:03:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:03:38,291 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:03:38,292 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:03:38,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-02-05 23:03:38,626 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 23:03:38,626 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:03:38,646 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:03:38,648 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:03:38,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:03:38 BoogieIcfgContainer [2025-02-05 23:03:38,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:03:38,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:03:38,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:03:38,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:03:38,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:03:37" (1/3) ... [2025-02-05 23:03:38,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfb8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:03:38, skipping insertion in model container [2025-02-05 23:03:38,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:03:38" (2/3) ... [2025-02-05 23:03:38,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfb8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:03:38, skipping insertion in model container [2025-02-05 23:03:38,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:03:38" (3/3) ... [2025-02-05 23:03:38,657 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-02-05 23:03:38,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:03:38,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:03:38,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:03:38,718 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;@1e9e3f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:03:38,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:03:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 23:03:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 23:03:38,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:38,729 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:38,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:38,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 78330427, now seen corresponding path program 1 times [2025-02-05 23:03:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-02-05 23:03:38,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:38,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 23:03:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 23:03:38,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:38,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 23:03:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-02-05 23:03:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221803913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314069390] [2025-02-05 23:03:38,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:38,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:03:38,989 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-05 23:03:38,990 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-05 23:03:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 23:03:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 23:03:39,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:39,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:39,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:03:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:03:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 23:03:39,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:03:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314069390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:03:39,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:03:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209935489] [2025-02-05 23:03:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:39,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:03:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:39,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:03:39,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:03:39,163 INFO L87 Difference]: Start difference. First operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 23:03:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:39,192 INFO L93 Difference]: Finished difference Result 186 states and 312 transitions. [2025-02-05 23:03:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:03:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2025-02-05 23:03:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:39,200 INFO L225 Difference]: With dead ends: 186 [2025-02-05 23:03:39,200 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 23:03:39,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-05 23:03:39,205 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:39,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:03:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 23:03:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 23:03:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 23:03:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-02-05 23:03:39,240 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2025-02-05 23:03:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:39,241 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-02-05 23:03:39,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 23:03:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-02-05 23:03:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 23:03:39,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:39,244 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:39,251 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-05 23:03:39,448 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-05 23:03:39,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1769525890, now seen corresponding path program 1 times [2025-02-05 23:03:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:39,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903397104] [2025-02-05 23:03:39,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:39,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 23:03:39,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 23:03:39,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:39,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:03:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:39,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903397104] [2025-02-05 23:03:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903397104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:39,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:39,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:03:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207485858] [2025-02-05 23:03:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:39,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:03:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:39,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:03:39,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:03:39,770 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:39,812 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-02-05 23:03:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:03:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-02-05 23:03:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:39,814 INFO L225 Difference]: With dead ends: 184 [2025-02-05 23:03:39,816 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 23:03:39,817 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-05 23:03:39,817 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:39,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:03:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 23:03:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-05 23:03:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 23:03:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2025-02-05 23:03:39,829 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2025-02-05 23:03:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:39,830 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-02-05 23:03:39,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2025-02-05 23:03:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:03:39,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:39,831 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:39,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:03:39,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2020996478, now seen corresponding path program 1 times [2025-02-05 23:03:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:39,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-02-05 23:03:39,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:39,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:39,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:39,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:03:39,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-02-05 23:03:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061365981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:39,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:03:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609819172] [2025-02-05 23:03:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:39,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:03:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:39,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:03:39,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:03:39,965 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:40,049 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2025-02-05 23:03:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:03:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 23:03:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:40,052 INFO L225 Difference]: With dead ends: 261 [2025-02-05 23:03:40,054 INFO L226 Difference]: Without dead ends: 170 [2025-02-05 23:03:40,054 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-05 23:03:40,055 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:40,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 305 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:03:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-05 23:03:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-02-05 23:03:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 133 states have internal predecessors, (188), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:03:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2025-02-05 23:03:40,077 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 138 [2025-02-05 23:03:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2025-02-05 23:03:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2025-02-05 23:03:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:03:40,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:40,080 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:03:40,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 224045119, now seen corresponding path program 1 times [2025-02-05 23:03:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273093991] [2025-02-05 23:03:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:40,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:40,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:40,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:03:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273093991] [2025-02-05 23:03:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273093991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891286703] [2025-02-05 23:03:43,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:03:43,079 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-05 23:03:43,083 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-05 23:03:43,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:43,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:43,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:43,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:43,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:03:43,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:03:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-02-05 23:03:43,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:03:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:03:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891286703] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:03:43,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:03:43,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 20 [2025-02-05 23:03:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26536575] [2025-02-05 23:03:43,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:03:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 23:03:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:43,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 23:03:43,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:03:43,738 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 23:03:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:45,658 INFO L93 Difference]: Finished difference Result 588 states and 885 transitions. [2025-02-05 23:03:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:03:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2025-02-05 23:03:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:45,664 INFO L225 Difference]: With dead ends: 588 [2025-02-05 23:03:45,664 INFO L226 Difference]: Without dead ends: 424 [2025-02-05 23:03:45,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2025-02-05 23:03:45,666 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 755 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:45,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 511 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 23:03:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-05 23:03:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 175. [2025-02-05 23:03:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.391304347826087) internal successors, (192), 139 states have internal predecessors, (192), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:03:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 256 transitions. [2025-02-05 23:03:45,693 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 256 transitions. Word has length 138 [2025-02-05 23:03:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 256 transitions. [2025-02-05 23:03:45,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 23:03:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 256 transitions. [2025-02-05 23:03:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:03:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:45,696 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:45,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:03:45,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:45,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:45,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1814011170, now seen corresponding path program 1 times [2025-02-05 23:03:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727882739] [2025-02-05 23:03:45,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:45,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:45,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:03:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727882739] [2025-02-05 23:03:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727882739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774812334] [2025-02-05 23:03:48,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:03:48,245 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-05 23:03:48,252 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-05 23:03:48,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:48,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:48,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 23:03:48,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:03:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-05 23:03:48,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:03:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:03:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774812334] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:03:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 11] total 27 [2025-02-05 23:03:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828721510] [2025-02-05 23:03:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:50,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:03:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:03:50,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-02-05 23:03:50,132 INFO L87 Difference]: Start difference. First operand 175 states and 256 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:52,529 INFO L93 Difference]: Finished difference Result 823 states and 1214 transitions. [2025-02-05 23:03:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:03:52,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 23:03:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:52,532 INFO L225 Difference]: With dead ends: 823 [2025-02-05 23:03:52,532 INFO L226 Difference]: Without dead ends: 651 [2025-02-05 23:03:52,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2025-02-05 23:03:52,534 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 532 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:52,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 531 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 23:03:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-05 23:03:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 464. [2025-02-05 23:03:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 413 states have (on average 1.4673123486682809) internal successors, (606), 416 states have internal predecessors, (606), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:03:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 690 transitions. [2025-02-05 23:03:52,577 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 690 transitions. Word has length 138 [2025-02-05 23:03:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:52,577 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 690 transitions. [2025-02-05 23:03:52,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 690 transitions. [2025-02-05 23:03:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:03:52,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:52,579 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:52,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 23:03:52,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:52,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:52,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1313106342, now seen corresponding path program 1 times [2025-02-05 23:03:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:52,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941447983] [2025-02-05 23:03:52,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:52,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:52,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:03:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941447983] [2025-02-05 23:03:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941447983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942988291] [2025-02-05 23:03:55,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:55,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:03:55,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:03:55,359 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-05 23:03:55,362 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-05 23:03:55,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:55,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 23:03:55,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:03:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-05 23:03:56,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:03:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:03:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942988291] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 23:03:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:03:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 12] total 26 [2025-02-05 23:03:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447281922] [2025-02-05 23:03:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:03:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:03:57,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-02-05 23:03:57,425 INFO L87 Difference]: Start difference. First operand 464 states and 690 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:59,431 INFO L93 Difference]: Finished difference Result 1434 states and 2116 transitions. [2025-02-05 23:03:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:03:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 23:03:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:59,436 INFO L225 Difference]: With dead ends: 1434 [2025-02-05 23:03:59,436 INFO L226 Difference]: Without dead ends: 973 [2025-02-05 23:03:59,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:03:59,438 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 529 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:59,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 586 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 23:03:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-05 23:03:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 468. [2025-02-05 23:03:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 417 states have (on average 1.4676258992805755) internal successors, (612), 420 states have internal predecessors, (612), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:03:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 696 transitions. [2025-02-05 23:03:59,471 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 696 transitions. Word has length 138 [2025-02-05 23:03:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:59,472 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 696 transitions. [2025-02-05 23:03:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:03:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 696 transitions. [2025-02-05 23:03:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:03:59,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:59,474 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:03:59,483 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-05 23:03:59,675 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,SelfDestructingSolverStorable5 [2025-02-05 23:03:59,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 403746783, now seen corresponding path program 1 times [2025-02-05 23:03:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213189678] [2025-02-05 23:03:59,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:59,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:03:59,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:03:59,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:59,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:04:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213189678] [2025-02-05 23:04:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213189678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:04:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631898642] [2025-02-05 23:04:01,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:04:01,505 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-05 23:04:01,506 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-05 23:04:01,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:04:01,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:04:01,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:01,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:01,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 23:04:01,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:04:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 332 proven. 66 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-02-05 23:04:02,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:04:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-02-05 23:04:02,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631898642] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:04:02,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:04:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 30 [2025-02-05 23:04:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47027393] [2025-02-05 23:04:02,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:04:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 23:04:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:02,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 23:04:02,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:04:02,948 INFO L87 Difference]: Start difference. First operand 468 states and 696 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 23:04:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:19,715 INFO L93 Difference]: Finished difference Result 2802 states and 4139 transitions. [2025-02-05 23:04:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 23:04:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2025-02-05 23:04:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:19,730 INFO L225 Difference]: With dead ends: 2802 [2025-02-05 23:04:19,735 INFO L226 Difference]: Without dead ends: 2337 [2025-02-05 23:04:19,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=784, Invalid=4328, Unknown=0, NotChecked=0, Total=5112 [2025-02-05 23:04:19,737 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2263 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 4887 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 5176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:19,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2893 Invalid, 5176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4887 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2025-02-05 23:04:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-02-05 23:04:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 855. [2025-02-05 23:04:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 750 states have (on average 1.456) internal successors, (1092), 756 states have internal predecessors, (1092), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:04:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1260 transitions. [2025-02-05 23:04:19,841 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1260 transitions. Word has length 138 [2025-02-05 23:04:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:19,844 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1260 transitions. [2025-02-05 23:04:19,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2025-02-05 23:04:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1260 transitions. [2025-02-05 23:04:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:04:19,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:19,851 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 23:04:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:20,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2068747715, now seen corresponding path program 1 times [2025-02-05 23:04:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-02-05 23:04:20,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:20,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:04:20,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:04:20,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:20,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:04:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-02-05 23:04:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:04:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969012142] [2025-02-05 23:04:20,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:20,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:04:20,750 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-05 23:04:20,758 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-05 23:04:20,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:04:20,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:04:20,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:20,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:20,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 23:04:20,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:04:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-05 23:04:21,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:04:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969012142] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 23:04:22,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:04:22,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2025-02-05 23:04:22,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526190377] [2025-02-05 23:04:22,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:22,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:04:22,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:22,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:04:22,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:04:22,084 INFO L87 Difference]: Start difference. First operand 855 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:23,796 INFO L93 Difference]: Finished difference Result 2161 states and 3182 transitions. [2025-02-05 23:04:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:04:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 23:04:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:23,802 INFO L225 Difference]: With dead ends: 2161 [2025-02-05 23:04:23,802 INFO L226 Difference]: Without dead ends: 1309 [2025-02-05 23:04:23,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 23:04:23,805 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 349 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:23,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 941 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 23:04:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-02-05 23:04:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 883. [2025-02-05 23:04:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 778 states have (on average 1.4524421593830334) internal successors, (1130), 784 states have internal predecessors, (1130), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:04:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1298 transitions. [2025-02-05 23:04:23,855 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1298 transitions. Word has length 138 [2025-02-05 23:04:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:23,856 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1298 transitions. [2025-02-05 23:04:23,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1298 transitions. [2025-02-05 23:04:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 23:04:23,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:23,858 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:23,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 23:04:24,058 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,SelfDestructingSolverStorable7 [2025-02-05 23:04:24,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1567842887, now seen corresponding path program 1 times [2025-02-05 23:04:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847966180] [2025-02-05 23:04:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:24,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:04:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:04:24,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:04:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:24,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847966180] [2025-02-05 23:04:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847966180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:04:24,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404779264] [2025-02-05 23:04:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:04:24,663 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-05 23:04:24,667 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-05 23:04:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 23:04:24,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 23:04:24,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:24,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:24,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 23:04:24,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:04:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 450 proven. 84 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 23:04:25,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:04:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404779264] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 23:04:26,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:04:26,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 18] total 28 [2025-02-05 23:04:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518712796] [2025-02-05 23:04:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:04:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:26,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:04:26,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-05 23:04:26,443 INFO L87 Difference]: Start difference. First operand 883 states and 1298 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:28,196 INFO L93 Difference]: Finished difference Result 2699 states and 3948 transitions. [2025-02-05 23:04:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:04:28,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-02-05 23:04:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:28,206 INFO L225 Difference]: With dead ends: 2699 [2025-02-05 23:04:28,207 INFO L226 Difference]: Without dead ends: 1819 [2025-02-05 23:04:28,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 23:04:28,211 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 621 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:28,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 952 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 23:04:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-02-05 23:04:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1059. [2025-02-05 23:04:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 954 states have (on average 1.471698113207547) internal successors, (1404), 960 states have internal predecessors, (1404), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:04:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1572 transitions. [2025-02-05 23:04:28,275 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1572 transitions. Word has length 138 [2025-02-05 23:04:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1572 transitions. [2025-02-05 23:04:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1572 transitions. [2025-02-05 23:04:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 23:04:28,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:28,278 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:28,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 23:04:28,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:28,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:28,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash -334411428, now seen corresponding path program 1 times [2025-02-05 23:04:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019530629] [2025-02-05 23:04:28,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 23:04:28,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 23:04:28,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:28,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:04:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660372155] [2025-02-05 23:04:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:04:28,536 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-05 23:04:28,537 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-05 23:04:28,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 23:04:28,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 23:04:28,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:28,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:28,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 23:04:28,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:04:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-05 23:04:28,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:04:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 23:04:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019530629] [2025-02-05 23:04:29,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 23:04:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660372155] [2025-02-05 23:04:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660372155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:04:29,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:04:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-05 23:04:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270483501] [2025-02-05 23:04:29,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:04:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:04:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:29,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:04:29,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:04:29,025 INFO L87 Difference]: Start difference. First operand 1059 states and 1572 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 23:04:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:29,817 INFO L93 Difference]: Finished difference Result 2792 states and 4025 transitions. [2025-02-05 23:04:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 23:04:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 140 [2025-02-05 23:04:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:29,822 INFO L225 Difference]: With dead ends: 2792 [2025-02-05 23:04:29,823 INFO L226 Difference]: Without dead ends: 1736 [2025-02-05 23:04:29,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-02-05 23:04:29,824 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 337 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:29,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 739 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:04:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-02-05 23:04:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1057. [2025-02-05 23:04:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 960 states have (on average 1.4479166666666667) internal successors, (1390), 966 states have internal predecessors, (1390), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 23:04:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1534 transitions. [2025-02-05 23:04:29,863 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1534 transitions. Word has length 140 [2025-02-05 23:04:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1534 transitions. [2025-02-05 23:04:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 23:04:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1534 transitions. [2025-02-05 23:04:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 23:04:29,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:29,865 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:29,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 23:04:30,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:30,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:30,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1208872, now seen corresponding path program 1 times [2025-02-05 23:04:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391110465] [2025-02-05 23:04:30,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:30,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:30,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 23:04:30,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 23:04:30,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:30,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391110465] [2025-02-05 23:04:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391110465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:04:30,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:04:30,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:04:30,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317083316] [2025-02-05 23:04:30,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:04:30,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:30,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:04:30,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:04:30,107 INFO L87 Difference]: Start difference. First operand 1057 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:30,215 INFO L93 Difference]: Finished difference Result 2321 states and 3334 transitions. [2025-02-05 23:04:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:04:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-02-05 23:04:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:30,220 INFO L225 Difference]: With dead ends: 2321 [2025-02-05 23:04:30,220 INFO L226 Difference]: Without dead ends: 1267 [2025-02-05 23:04:30,222 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-05 23:04:30,222 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:30,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 251 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:04:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-02-05 23:04:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2025-02-05 23:04:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1060 states have (on average 1.3962264150943395) internal successors, (1480), 1069 states have internal predecessors, (1480), 134 states have call successors, (134), 42 states have call predecessors, (134), 42 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 23:04:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1748 transitions. [2025-02-05 23:04:30,285 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1748 transitions. Word has length 140 [2025-02-05 23:04:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:30,285 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1748 transitions. [2025-02-05 23:04:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1748 transitions. [2025-02-05 23:04:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 23:04:30,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:30,287 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:04:30,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:30,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash 221817114, now seen corresponding path program 1 times [2025-02-05 23:04:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792444443] [2025-02-05 23:04:30,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 23:04:30,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 23:04:30,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792444443] [2025-02-05 23:04:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792444443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:04:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:04:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:04:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816092371] [2025-02-05 23:04:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:30,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:04:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:30,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:04:30,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:04:30,835 INFO L87 Difference]: Start difference. First operand 1237 states and 1748 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:31,507 INFO L93 Difference]: Finished difference Result 3974 states and 5460 transitions. [2025-02-05 23:04:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:04:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-02-05 23:04:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:31,516 INFO L225 Difference]: With dead ends: 3974 [2025-02-05 23:04:31,517 INFO L226 Difference]: Without dead ends: 2752 [2025-02-05 23:04:31,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:04:31,520 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 276 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:31,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 490 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:04:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-02-05 23:04:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 1919. [2025-02-05 23:04:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1661 states have (on average 1.3895243829018664) internal successors, (2308), 1678 states have internal predecessors, (2308), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-02-05 23:04:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2682 transitions. [2025-02-05 23:04:31,645 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2682 transitions. Word has length 140 [2025-02-05 23:04:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:31,645 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 2682 transitions. [2025-02-05 23:04:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2682 transitions. [2025-02-05 23:04:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 23:04:31,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:31,648 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:31,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:04:31,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2023225590, now seen corresponding path program 1 times [2025-02-05 23:04:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135836304] [2025-02-05 23:04:31,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:31,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:04:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:04:31,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:31,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135836304] [2025-02-05 23:04:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135836304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:04:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:04:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:04:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71746522] [2025-02-05 23:04:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:04:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:04:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:04:33,116 INFO L87 Difference]: Start difference. First operand 1919 states and 2682 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:35,241 INFO L93 Difference]: Finished difference Result 4002 states and 5603 transitions. [2025-02-05 23:04:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:04:35,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2025-02-05 23:04:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:35,247 INFO L225 Difference]: With dead ends: 4002 [2025-02-05 23:04:35,247 INFO L226 Difference]: Without dead ends: 2124 [2025-02-05 23:04:35,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:04:35,249 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 389 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:35,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1184 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 23:04:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-02-05 23:04:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1986. [2025-02-05 23:04:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1728 states have (on average 1.3796296296296295) internal successors, (2384), 1745 states have internal predecessors, (2384), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-02-05 23:04:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2758 transitions. [2025-02-05 23:04:35,358 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2758 transitions. Word has length 141 [2025-02-05 23:04:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:35,358 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2758 transitions. [2025-02-05 23:04:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2758 transitions. [2025-02-05 23:04:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 23:04:35,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:35,360 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:35,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:04:35,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1800199604, now seen corresponding path program 1 times [2025-02-05 23:04:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631982808] [2025-02-05 23:04:35,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:35,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:04:35,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:04:35,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:35,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 23:04:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631982808] [2025-02-05 23:04:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631982808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:04:35,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:04:35,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:04:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808702674] [2025-02-05 23:04:35,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:35,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:04:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:35,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:04:35,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:04:35,668 INFO L87 Difference]: Start difference. First operand 1986 states and 2758 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:36,303 INFO L93 Difference]: Finished difference Result 4527 states and 6199 transitions. [2025-02-05 23:04:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:04:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2025-02-05 23:04:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:36,312 INFO L225 Difference]: With dead ends: 4527 [2025-02-05 23:04:36,312 INFO L226 Difference]: Without dead ends: 2582 [2025-02-05 23:04:36,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:04:36,315 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:36,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 635 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:04:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2025-02-05 23:04:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1898. [2025-02-05 23:04:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1640 states have (on average 1.3676829268292683) internal successors, (2243), 1657 states have internal predecessors, (2243), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-02-05 23:04:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2617 transitions. [2025-02-05 23:04:36,435 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2617 transitions. Word has length 141 [2025-02-05 23:04:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:36,435 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2617 transitions. [2025-02-05 23:04:36,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 23:04:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2617 transitions. [2025-02-05 23:04:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 23:04:36,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:36,438 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:04:36,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:04:36,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:36,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1211444662, now seen corresponding path program 1 times [2025-02-05 23:04:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910248565] [2025-02-05 23:04:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:36,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:04:36,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:04:36,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:36,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:04:36,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578117177] [2025-02-05 23:04:36,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:36,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:04:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:04:36,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:04:36,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 23:04:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:04:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:04:36,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:36,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:36,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 23:04:36,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:04:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-02-05 23:04:37,146 INFO L312 TraceCheckSpWp]: Computing backward predicates...