./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.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_loopvsstraightlinecode_100-1loop_file-68.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 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:50:06,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:50:06,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:50:06,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:50:06,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:50:06,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:50:06,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:50:06,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:50:06,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:50:06,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:50:06,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:50:06,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:50:06,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:50:06,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:50:06,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:50:06,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:50:06,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:50:06,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:50:06,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:50:06,291 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 -> 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 [2025-02-06 00:50:06,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:50:06,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:50:06,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:50:06,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:50:06,521 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:50:06,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-02-06 00:50:07,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5658c1944/bdb2fa0c67524b198e49e53f8562f06a/FLAG4f0037516 [2025-02-06 00:50:07,887 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:50:07,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-02-06 00:50:07,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5658c1944/bdb2fa0c67524b198e49e53f8562f06a/FLAG4f0037516 [2025-02-06 00:50:07,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5658c1944/bdb2fa0c67524b198e49e53f8562f06a [2025-02-06 00:50:07,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:50:07,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:50:07,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:50:07,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:50:07,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:50:07,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:07" (1/1) ... [2025-02-06 00:50:07,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5742db2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:07, skipping insertion in model container [2025-02-06 00:50:07,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:07" (1/1) ... [2025-02-06 00:50:07,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:50:08,042 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-02-06 00:50:08,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:50:08,138 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:50:08,147 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-02-06 00:50:08,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:50:08,215 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:50:08,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08 WrapperNode [2025-02-06 00:50:08,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:50:08,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:50:08,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:50:08,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:50:08,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,269 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2025-02-06 00:50:08,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:50:08,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:50:08,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:50:08,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:50:08,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,297 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:50:08,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:50:08,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:50:08,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:50:08,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:50:08,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (1/1) ... [2025-02-06 00:50:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:50:08,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:08,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:50:08,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:50:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:50:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:50:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:50:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:50:08,471 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:50:08,473 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:50:08,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-02-06 00:50:09,002 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-02-06 00:50:09,002 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:50:09,029 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:50:09,031 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:50:09,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:09 BoogieIcfgContainer [2025-02-06 00:50:09,031 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:50:09,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:50:09,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:50:09,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:50:09,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:50:07" (1/3) ... [2025-02-06 00:50:09,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d57de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:09, skipping insertion in model container [2025-02-06 00:50:09,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:08" (2/3) ... [2025-02-06 00:50:09,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d57de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:09, skipping insertion in model container [2025-02-06 00:50:09,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:09" (3/3) ... [2025-02-06 00:50:09,040 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-02-06 00:50:09,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:50:09,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i that has 2 procedures, 162 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:50:09,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:50:09,115 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;@64d78129, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:50:09,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:50:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 00:50:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-06 00:50:09,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:09,131 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:09,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:09,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2112434822, now seen corresponding path program 1 times [2025-02-06 00:50:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035435650] [2025-02-06 00:50:09,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:09,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 00:50:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 00:50:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-02-06 00:50:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035435650] [2025-02-06 00:50:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035435650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44880414] [2025-02-06 00:50:09,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:09,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:09,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:09,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:50:09,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 00:50:09,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 00:50:09,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:09,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:09,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:50:09,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-02-06 00:50:09,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:50:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44880414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:50:09,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:50:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159233216] [2025-02-06 00:50:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:50:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:50:09,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:50:09,754 INFO L87 Difference]: Start difference. First operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:09,798 INFO L93 Difference]: Finished difference Result 321 states and 543 transitions. [2025-02-06 00:50:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:50:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 269 [2025-02-06 00:50:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:09,805 INFO L225 Difference]: With dead ends: 321 [2025-02-06 00:50:09,806 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 00:50:09,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:50:09,811 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:09,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:50:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 00:50:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 00:50:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 00:50:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-02-06 00:50:09,851 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 269 [2025-02-06 00:50:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-02-06 00:50:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-02-06 00:50:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-06 00:50:09,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:09,858 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:09,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:50:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:50:10,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2079483428, now seen corresponding path program 1 times [2025-02-06 00:50:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726419843] [2025-02-06 00:50:10,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:10,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 00:50:10,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 00:50:10,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:10,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726419843] [2025-02-06 00:50:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726419843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:50:12,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609408292] [2025-02-06 00:50:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:12,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:50:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:12,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:50:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:50:12,150 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:13,119 INFO L93 Difference]: Finished difference Result 633 states and 980 transitions. [2025-02-06 00:50:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:50:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 269 [2025-02-06 00:50:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:13,127 INFO L225 Difference]: With dead ends: 633 [2025-02-06 00:50:13,128 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 00:50:13,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:50:13,131 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 564 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:13,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 931 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:50:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 00:50:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 450. [2025-02-06 00:50:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 363 states have (on average 1.4710743801652892) internal successors, (534), 364 states have internal predecessors, (534), 83 states have call successors, (83), 3 states have call predecessors, (83), 3 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 00:50:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 700 transitions. [2025-02-06 00:50:13,180 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 700 transitions. Word has length 269 [2025-02-06 00:50:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:13,183 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 700 transitions. [2025-02-06 00:50:13,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 700 transitions. [2025-02-06 00:50:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-06 00:50:13,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:13,189 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:50:13,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:13,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash -862174171, now seen corresponding path program 1 times [2025-02-06 00:50:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910264296] [2025-02-06 00:50:13,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:13,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 00:50:13,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 00:50:13,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:13,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910264296] [2025-02-06 00:50:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910264296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214778643] [2025-02-06 00:50:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:13,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:13,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:50:13,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 00:50:13,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 00:50:13,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:13,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:13,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 00:50:13,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1509 proven. 72 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2025-02-06 00:50:13,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214778643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:14,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-02-06 00:50:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759814237] [2025-02-06 00:50:14,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:14,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:50:14,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:14,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:50:14,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:50:14,243 INFO L87 Difference]: Start difference. First operand 450 states and 700 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-02-06 00:50:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:15,066 INFO L93 Difference]: Finished difference Result 1181 states and 1815 transitions. [2025-02-06 00:50:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 00:50:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) Word has length 269 [2025-02-06 00:50:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:15,072 INFO L225 Difference]: With dead ends: 1181 [2025-02-06 00:50:15,072 INFO L226 Difference]: Without dead ends: 734 [2025-02-06 00:50:15,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2025-02-06 00:50:15,074 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 429 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:15,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 958 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:50:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-02-06 00:50:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 722. [2025-02-06 00:50:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 597 states have (on average 1.390284757118928) internal successors, (830), 601 states have internal predecessors, (830), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 00:50:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1054 transitions. [2025-02-06 00:50:15,148 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1054 transitions. Word has length 269 [2025-02-06 00:50:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:15,148 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1054 transitions. [2025-02-06 00:50:15,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (100), 2 states have call predecessors, (100), 4 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-02-06 00:50:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1054 transitions. [2025-02-06 00:50:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 00:50:15,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:15,152 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:15,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:50:15,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:15,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:15,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1844445113, now seen corresponding path program 1 times [2025-02-06 00:50:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488626957] [2025-02-06 00:50:15,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:15,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 00:50:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 00:50:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:15,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:15,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488626957] [2025-02-06 00:50:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488626957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:50:15,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83223658] [2025-02-06 00:50:15,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:15,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:50:15,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:15,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:50:15,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:50:15,559 INFO L87 Difference]: Start difference. First operand 722 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:15,664 INFO L93 Difference]: Finished difference Result 2158 states and 3154 transitions. [2025-02-06 00:50:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:50:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 270 [2025-02-06 00:50:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:15,675 INFO L225 Difference]: With dead ends: 2158 [2025-02-06 00:50:15,675 INFO L226 Difference]: Without dead ends: 1439 [2025-02-06 00:50:15,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:50:15,679 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 157 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:15,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 514 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:50:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-06 00:50:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-02-06 00:50:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1188 states have (on average 1.3821548821548821) internal successors, (1642), 1196 states have internal predecessors, (1642), 224 states have call successors, (224), 24 states have call predecessors, (224), 24 states have return successors, (224), 216 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 00:50:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2090 transitions. [2025-02-06 00:50:15,799 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2090 transitions. Word has length 270 [2025-02-06 00:50:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2090 transitions. [2025-02-06 00:50:15,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2090 transitions. [2025-02-06 00:50:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 00:50:15,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:15,804 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:50:15,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -15249832, now seen corresponding path program 1 times [2025-02-06 00:50:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604749318] [2025-02-06 00:50:15,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 00:50:15,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 00:50:15,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:15,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604749318] [2025-02-06 00:50:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604749318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 00:50:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686145835] [2025-02-06 00:50:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 00:50:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:17,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 00:50:17,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:50:17,921 INFO L87 Difference]: Start difference. First operand 1437 states and 2090 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:20,090 INFO L93 Difference]: Finished difference Result 3936 states and 5648 transitions. [2025-02-06 00:50:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:50:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 271 [2025-02-06 00:50:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:20,103 INFO L225 Difference]: With dead ends: 3936 [2025-02-06 00:50:20,106 INFO L226 Difference]: Without dead ends: 2502 [2025-02-06 00:50:20,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:50:20,111 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1928 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:20,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1249 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 00:50:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2025-02-06 00:50:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1865. [2025-02-06 00:50:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1496 states have (on average 1.356951871657754) internal successors, (2030), 1508 states have internal predecessors, (2030), 330 states have call successors, (330), 38 states have call predecessors, (330), 38 states have return successors, (330), 318 states have call predecessors, (330), 330 states have call successors, (330) [2025-02-06 00:50:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2690 transitions. [2025-02-06 00:50:20,230 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2690 transitions. Word has length 271 [2025-02-06 00:50:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:20,231 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2690 transitions. [2025-02-06 00:50:20,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2690 transitions. [2025-02-06 00:50:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 00:50:20,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:20,235 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:20,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:50:20,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:20,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:20,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1492301977, now seen corresponding path program 1 times [2025-02-06 00:50:20,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:20,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774614987] [2025-02-06 00:50:20,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:20,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:20,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 00:50:20,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 00:50:20,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:20,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774614987] [2025-02-06 00:50:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774614987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:21,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:50:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306277973] [2025-02-06 00:50:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:21,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:50:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:21,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:50:21,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:50:21,896 INFO L87 Difference]: Start difference. First operand 1865 states and 2690 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:23,225 INFO L93 Difference]: Finished difference Result 4244 states and 6101 transitions. [2025-02-06 00:50:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 00:50:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 271 [2025-02-06 00:50:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:23,242 INFO L225 Difference]: With dead ends: 4244 [2025-02-06 00:50:23,242 INFO L226 Difference]: Without dead ends: 2358 [2025-02-06 00:50:23,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:50:23,249 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 842 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:23,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1175 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:50:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2025-02-06 00:50:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1857. [2025-02-06 00:50:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1488 states have (on average 1.3588709677419355) internal successors, (2022), 1500 states have internal predecessors, (2022), 330 states have call successors, (330), 38 states have call predecessors, (330), 38 states have return successors, (330), 318 states have call predecessors, (330), 330 states have call successors, (330) [2025-02-06 00:50:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2682 transitions. [2025-02-06 00:50:23,387 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2682 transitions. Word has length 271 [2025-02-06 00:50:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2682 transitions. [2025-02-06 00:50:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2682 transitions. [2025-02-06 00:50:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 00:50:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:23,394 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:23,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:50:23,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1338059865, now seen corresponding path program 1 times [2025-02-06 00:50:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334029589] [2025-02-06 00:50:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:23,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 00:50:23,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 00:50:23,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:23,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:28,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334029589] [2025-02-06 00:50:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334029589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 00:50:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610215368] [2025-02-06 00:50:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:28,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:50:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:28,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:50:28,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:50:28,644 INFO L87 Difference]: Start difference. First operand 1857 states and 2682 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:32,446 INFO L93 Difference]: Finished difference Result 6630 states and 9438 transitions. [2025-02-06 00:50:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 00:50:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 271 [2025-02-06 00:50:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:32,468 INFO L225 Difference]: With dead ends: 6630 [2025-02-06 00:50:32,468 INFO L226 Difference]: Without dead ends: 4776 [2025-02-06 00:50:32,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:50:32,476 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1860 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:32,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 1865 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 00:50:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2025-02-06 00:50:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 3516. [2025-02-06 00:50:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2935 states have (on average 1.3706984667802384) internal successors, (4023), 2959 states have internal predecessors, (4023), 514 states have call successors, (514), 66 states have call predecessors, (514), 66 states have return successors, (514), 490 states have call predecessors, (514), 514 states have call successors, (514) [2025-02-06 00:50:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 5051 transitions. [2025-02-06 00:50:32,674 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 5051 transitions. Word has length 271 [2025-02-06 00:50:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:32,674 INFO L471 AbstractCegarLoop]: Abstraction has 3516 states and 5051 transitions. [2025-02-06 00:50:32,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 5051 transitions. [2025-02-06 00:50:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 00:50:32,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:32,680 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:50:32,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:32,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1449355622, now seen corresponding path program 1 times [2025-02-06 00:50:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401735786] [2025-02-06 00:50:32,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 00:50:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 00:50:32,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401735786] [2025-02-06 00:50:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401735786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156765581] [2025-02-06 00:50:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:33,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:33,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:33,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:50:33,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 00:50:33,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 00:50:33,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:33,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:33,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 00:50:33,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1190 proven. 48 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-02-06 00:50:33,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156765581] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:33,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-02-06 00:50:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808356361] [2025-02-06 00:50:33,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 00:50:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 00:50:33,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-02-06 00:50:33,898 INFO L87 Difference]: Start difference. First operand 3516 states and 5051 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-02-06 00:50:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:37,269 INFO L93 Difference]: Finished difference Result 14003 states and 19544 transitions. [2025-02-06 00:50:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-02-06 00:50:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) Word has length 271 [2025-02-06 00:50:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:37,311 INFO L225 Difference]: With dead ends: 14003 [2025-02-06 00:50:37,311 INFO L226 Difference]: Without dead ends: 10490 [2025-02-06 00:50:37,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 549 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3926 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2006, Invalid=8094, Unknown=0, NotChecked=0, Total=10100 [2025-02-06 00:50:37,324 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2584 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:37,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 1692 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 00:50:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2025-02-06 00:50:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 4234. [2025-02-06 00:50:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3544 states have (on average 1.3589164785553047) internal successors, (4816), 3569 states have internal predecessors, (4816), 554 states have call successors, (554), 135 states have call predecessors, (554), 135 states have return successors, (554), 529 states have call predecessors, (554), 554 states have call successors, (554) [2025-02-06 00:50:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 5924 transitions. [2025-02-06 00:50:37,708 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 5924 transitions. Word has length 271 [2025-02-06 00:50:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:37,709 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 5924 transitions. [2025-02-06 00:50:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 4 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-02-06 00:50:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 5924 transitions. [2025-02-06 00:50:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-06 00:50:37,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:37,716 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:37,725 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-06 00:50:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:37,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:37,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash -522189598, now seen corresponding path program 1 times [2025-02-06 00:50:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:37,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540482085] [2025-02-06 00:50:37,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:37,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-06 00:50:37,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 00:50:37,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:37,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540482085] [2025-02-06 00:50:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540482085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:50:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987015384] [2025-02-06 00:50:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:50:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:50:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:50:38,394 INFO L87 Difference]: Start difference. First operand 4234 states and 5924 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:39,174 INFO L93 Difference]: Finished difference Result 11810 states and 16470 transitions. [2025-02-06 00:50:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:50:39,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-02-06 00:50:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:39,206 INFO L225 Difference]: With dead ends: 11810 [2025-02-06 00:50:39,206 INFO L226 Difference]: Without dead ends: 7658 [2025-02-06 00:50:39,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:50:39,214 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 270 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:39,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 678 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:50:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2025-02-06 00:50:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 6601. [2025-02-06 00:50:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 5473 states have (on average 1.355746391375845) internal successors, (7420), 5508 states have internal predecessors, (7420), 901 states have call successors, (901), 226 states have call predecessors, (901), 226 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-02-06 00:50:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 9222 transitions. [2025-02-06 00:50:39,713 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 9222 transitions. Word has length 272 [2025-02-06 00:50:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:39,714 INFO L471 AbstractCegarLoop]: Abstraction has 6601 states and 9222 transitions. [2025-02-06 00:50:39,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 9222 transitions. [2025-02-06 00:50:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-06 00:50:39,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:39,719 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:39,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:50:39,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1259083789, now seen corresponding path program 1 times [2025-02-06 00:50:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053423203] [2025-02-06 00:50:39,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:39,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-06 00:50:39,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-06 00:50:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053423203] [2025-02-06 00:50:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053423203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:50:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639494384] [2025-02-06 00:50:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:50:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:50:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:50:41,435 INFO L87 Difference]: Start difference. First operand 6601 states and 9222 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:43,123 INFO L93 Difference]: Finished difference Result 15269 states and 21299 transitions. [2025-02-06 00:50:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:50:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 273 [2025-02-06 00:50:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:43,150 INFO L225 Difference]: With dead ends: 15269 [2025-02-06 00:50:43,150 INFO L226 Difference]: Without dead ends: 8750 [2025-02-06 00:50:43,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-02-06 00:50:43,191 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 773 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:43,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1093 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 00:50:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8750 states. [2025-02-06 00:50:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8750 to 6769. [2025-02-06 00:50:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6769 states, 5641 states have (on average 1.362878922176919) internal successors, (7688), 5676 states have internal predecessors, (7688), 901 states have call successors, (901), 226 states have call predecessors, (901), 226 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-02-06 00:50:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 9490 transitions. [2025-02-06 00:50:43,795 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 9490 transitions. Word has length 273 [2025-02-06 00:50:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:43,796 INFO L471 AbstractCegarLoop]: Abstraction has 6769 states and 9490 transitions. [2025-02-06 00:50:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-02-06 00:50:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 9490 transitions. [2025-02-06 00:50:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-06 00:50:43,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:43,801 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:50:43,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:43,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 94225908, now seen corresponding path program 1 times [2025-02-06 00:50:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762786513] [2025-02-06 00:50:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-06 00:50:43,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-06 00:50:43,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:43,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:44,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762786513] [2025-02-06 00:50:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762786513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:44,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667546768] [2025-02-06 00:50:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:44,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:44,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:50:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-06 00:50:44,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-06 00:50:44,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:44,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:44,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 00:50:44,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-02-06 00:50:44,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:44,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667546768] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:44,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 00:50:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184859781] [2025-02-06 00:50:44,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:44,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:50:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:44,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:50:44,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:50:44,612 INFO L87 Difference]: Start difference. First operand 6769 states and 9490 transitions. Second operand has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-02-06 00:50:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:45,664 INFO L93 Difference]: Finished difference Result 13762 states and 19266 transitions. [2025-02-06 00:50:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 00:50:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) Word has length 273 [2025-02-06 00:50:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:45,689 INFO L225 Difference]: With dead ends: 13762 [2025-02-06 00:50:45,689 INFO L226 Difference]: Without dead ends: 7075 [2025-02-06 00:50:45,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-02-06 00:50:45,702 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 594 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:45,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 653 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:50:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2025-02-06 00:50:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 6943. [2025-02-06 00:50:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6943 states, 5797 states have (on average 1.3517336553389685) internal successors, (7836), 5832 states have internal predecessors, (7836), 901 states have call successors, (901), 244 states have call predecessors, (901), 244 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-02-06 00:50:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 9638 transitions. [2025-02-06 00:50:46,190 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 9638 transitions. Word has length 273 [2025-02-06 00:50:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:46,191 INFO L471 AbstractCegarLoop]: Abstraction has 6943 states and 9638 transitions. [2025-02-06 00:50:46,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-02-06 00:50:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 9638 transitions. [2025-02-06 00:50:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 00:50:46,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:46,196 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:46,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 00:50:46,397 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,SelfDestructingSolverStorable10 [2025-02-06 00:50:46,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:46,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash 174361618, now seen corresponding path program 1 times [2025-02-06 00:50:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:46,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154265640] [2025-02-06 00:50:46,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:46,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 00:50:46,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 00:50:46,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:50:47,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:47,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154265640] [2025-02-06 00:50:47,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154265640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:50:47,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:50:47,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:50:47,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407269308] [2025-02-06 00:50:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:50:47,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:50:47,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:47,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:50:47,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:50:47,642 INFO L87 Difference]: Start difference. First operand 6943 states and 9638 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:49,014 INFO L93 Difference]: Finished difference Result 15838 states and 21912 transitions. [2025-02-06 00:50:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:50:49,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 274 [2025-02-06 00:50:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:49,037 INFO L225 Difference]: With dead ends: 15838 [2025-02-06 00:50:49,037 INFO L226 Difference]: Without dead ends: 8981 [2025-02-06 00:50:49,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:50:49,049 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 485 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:49,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1032 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:50:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2025-02-06 00:50:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 7422. [2025-02-06 00:50:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7422 states, 6276 states have (on average 1.3559592096876991) internal successors, (8510), 6311 states have internal predecessors, (8510), 901 states have call successors, (901), 244 states have call predecessors, (901), 244 states have return successors, (901), 866 states have call predecessors, (901), 901 states have call successors, (901) [2025-02-06 00:50:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 10312 transitions. [2025-02-06 00:50:49,531 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 10312 transitions. Word has length 274 [2025-02-06 00:50:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:49,532 INFO L471 AbstractCegarLoop]: Abstraction has 7422 states and 10312 transitions. [2025-02-06 00:50:49,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:50:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 10312 transitions. [2025-02-06 00:50:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 00:50:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:49,537 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:50:49,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:49,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 282631920, now seen corresponding path program 1 times [2025-02-06 00:50:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157650072] [2025-02-06 00:50:49,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:49,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 00:50:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 00:50:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157650072] [2025-02-06 00:50:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157650072] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743336272] [2025-02-06 00:50:49,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:49,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:49,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:49,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:49,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 00:50:49,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 00:50:49,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 00:50:49,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:49,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:49,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 00:50:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-02-06 00:50:50,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-02-06 00:50:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743336272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:50,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-02-06 00:50:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687501117] [2025-02-06 00:50:50,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:50,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 00:50:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:50,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 00:50:50,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:50:50,704 INFO L87 Difference]: Start difference. First operand 7422 states and 10312 transitions. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-02-06 00:50:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:52,208 INFO L93 Difference]: Finished difference Result 15634 states and 21317 transitions. [2025-02-06 00:50:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 00:50:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) Word has length 274 [2025-02-06 00:50:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:52,237 INFO L225 Difference]: With dead ends: 15634 [2025-02-06 00:50:52,237 INFO L226 Difference]: Without dead ends: 8298 [2025-02-06 00:50:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=543, Invalid=1527, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 00:50:52,249 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1207 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:52,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 578 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:50:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2025-02-06 00:50:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 7298. [2025-02-06 00:50:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7298 states, 5884 states have (on average 1.3128823929299795) internal successors, (7725), 5907 states have internal predecessors, (7725), 1068 states have call successors, (1068), 345 states have call predecessors, (1068), 345 states have return successors, (1068), 1045 states have call predecessors, (1068), 1068 states have call successors, (1068) [2025-02-06 00:50:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 9861 transitions. [2025-02-06 00:50:52,951 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 9861 transitions. Word has length 274 [2025-02-06 00:50:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:52,952 INFO L471 AbstractCegarLoop]: Abstraction has 7298 states and 9861 transitions. [2025-02-06 00:50:52,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 6 states have call successors, (95), 3 states have call predecessors, (95), 7 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-02-06 00:50:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 9861 transitions. [2025-02-06 00:50:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-06 00:50:52,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:52,957 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:52,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 00:50:53,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 00:50:53,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:53,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 66417457, now seen corresponding path program 1 times [2025-02-06 00:50:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049449949] [2025-02-06 00:50:53,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:53,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:50:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:50:53,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:53,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:50:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:50:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049449949] [2025-02-06 00:50:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049449949] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:50:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451116106] [2025-02-06 00:50:53,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:50:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:50:53,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:50:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 00:50:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:50:53,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:50:53,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:53,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:50:53,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 00:50:53,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:50:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2015 proven. 180 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-02-06 00:50:54,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:50:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-02-06 00:50:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451116106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:50:54,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:50:54,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-02-06 00:50:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172489437] [2025-02-06 00:50:54,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:50:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 00:50:54,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:50:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 00:50:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:50:54,341 INFO L87 Difference]: Start difference. First operand 7298 states and 9861 transitions. Second operand has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-02-06 00:50:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:50:56,766 INFO L93 Difference]: Finished difference Result 18876 states and 25402 transitions. [2025-02-06 00:50:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-06 00:50:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) Word has length 275 [2025-02-06 00:50:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:50:56,793 INFO L225 Difference]: With dead ends: 18876 [2025-02-06 00:50:56,793 INFO L226 Difference]: Without dead ends: 11581 [2025-02-06 00:50:56,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1221, Invalid=3069, Unknown=0, NotChecked=0, Total=4290 [2025-02-06 00:50:56,805 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3913 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3924 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:50:56,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3924 Valid, 802 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:50:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2025-02-06 00:50:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 6338. [2025-02-06 00:50:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 5413 states have (on average 1.3462035839645299) internal successors, (7287), 5420 states have internal predecessors, (7287), 679 states have call successors, (679), 245 states have call predecessors, (679), 245 states have return successors, (679), 672 states have call predecessors, (679), 679 states have call successors, (679) [2025-02-06 00:50:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 8645 transitions. [2025-02-06 00:50:57,382 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 8645 transitions. Word has length 275 [2025-02-06 00:50:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:50:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 6338 states and 8645 transitions. [2025-02-06 00:50:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.217391304347826) internal successors, (166), 22 states have internal predecessors, (166), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-02-06 00:50:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 8645 transitions. [2025-02-06 00:50:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-06 00:50:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:50:57,386 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:50:57,393 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-06 00:50:57,586 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,SelfDestructingSolverStorable13 [2025-02-06 00:50:57,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:50:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:50:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1498196316, now seen corresponding path program 1 times [2025-02-06 00:50:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:50:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647257333] [2025-02-06 00:50:57,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:50:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:50:57,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:50:57,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:50:57,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:50:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:51:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:51:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647257333] [2025-02-06 00:51:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647257333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:51:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003380022] [2025-02-06 00:51:03,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:51:03,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:51:03,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:51:03,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 00:51:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:51:03,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:51:03,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:03,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:03,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 00:51:03,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:51:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1619 proven. 138 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2025-02-06 00:51:04,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:51:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-02-06 00:51:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003380022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:51:04,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:51:04,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 28 [2025-02-06 00:51:04,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812551879] [2025-02-06 00:51:04,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:51:04,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 00:51:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:51:04,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 00:51:04,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-02-06 00:51:04,966 INFO L87 Difference]: Start difference. First operand 6338 states and 8645 transitions. Second operand has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-02-06 00:51:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:51:13,223 INFO L93 Difference]: Finished difference Result 24132 states and 33444 transitions. [2025-02-06 00:51:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-02-06 00:51:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) Word has length 275 [2025-02-06 00:51:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:51:13,255 INFO L225 Difference]: With dead ends: 24132 [2025-02-06 00:51:13,255 INFO L226 Difference]: Without dead ends: 17797 [2025-02-06 00:51:13,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1879, Invalid=7433, Unknown=0, NotChecked=0, Total=9312 [2025-02-06 00:51:13,267 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 2165 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4498 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:51:13,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 3283 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4498 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 00:51:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2025-02-06 00:51:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 7357. [2025-02-06 00:51:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7357 states, 6456 states have (on average 1.3726765799256506) internal successors, (8862), 6460 states have internal predecessors, (8862), 652 states have call successors, (652), 248 states have call predecessors, (652), 248 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-02-06 00:51:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 10166 transitions. [2025-02-06 00:51:13,950 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 10166 transitions. Word has length 275 [2025-02-06 00:51:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:51:13,950 INFO L471 AbstractCegarLoop]: Abstraction has 7357 states and 10166 transitions. [2025-02-06 00:51:13,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 5 states have call successors, (120), 4 states have call predecessors, (120), 8 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-02-06 00:51:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 10166 transitions. [2025-02-06 00:51:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-06 00:51:13,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:51:13,955 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:51:13,961 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-06 00:51:14,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:51:14,155 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:51:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:51:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -36616317, now seen corresponding path program 1 times [2025-02-06 00:51:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:51:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466680070] [2025-02-06 00:51:14,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:51:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:51:14,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:51:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-02-06 00:51:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:51:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466680070] [2025-02-06 00:51:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466680070] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:51:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139298556] [2025-02-06 00:51:14,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:14,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:51:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:51:14,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:51:14,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 00:51:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:51:14,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:51:14,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:14,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 00:51:14,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:51:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-02-06 00:51:14,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:51:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-02-06 00:51:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139298556] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:51:15,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:51:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 24 [2025-02-06 00:51:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829147711] [2025-02-06 00:51:15,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:51:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 00:51:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:51:15,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 00:51:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:51:15,276 INFO L87 Difference]: Start difference. First operand 7357 states and 10166 transitions. Second operand has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-02-06 00:51:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:51:17,598 INFO L93 Difference]: Finished difference Result 21289 states and 29056 transitions. [2025-02-06 00:51:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 00:51:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) Word has length 275 [2025-02-06 00:51:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:51:17,627 INFO L225 Difference]: With dead ends: 21289 [2025-02-06 00:51:17,627 INFO L226 Difference]: Without dead ends: 13935 [2025-02-06 00:51:17,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=850, Invalid=2230, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 00:51:17,639 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1436 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:51:17,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 962 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 00:51:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13935 states. [2025-02-06 00:51:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13935 to 2925. [2025-02-06 00:51:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2456 states have (on average 1.3053745928338762) internal successors, (3206), 2456 states have internal predecessors, (3206), 320 states have call successors, (320), 148 states have call predecessors, (320), 148 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-02-06 00:51:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3846 transitions. [2025-02-06 00:51:18,122 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3846 transitions. Word has length 275 [2025-02-06 00:51:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:51:18,123 INFO L471 AbstractCegarLoop]: Abstraction has 2925 states and 3846 transitions. [2025-02-06 00:51:18,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.0) internal successors, (161), 22 states have internal predecessors, (161), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-02-06 00:51:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3846 transitions. [2025-02-06 00:51:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-06 00:51:18,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:51:18,125 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:51:18,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 00:51:18,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 00:51:18,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:51:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:51:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1053498786, now seen corresponding path program 1 times [2025-02-06 00:51:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:51:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914541122] [2025-02-06 00:51:18,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:51:18,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-06 00:51:18,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-06 00:51:18,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:18,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:51:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:51:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914541122] [2025-02-06 00:51:18,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914541122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:51:18,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:51:18,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:51:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194148389] [2025-02-06 00:51:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:51:18,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:51:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:51:18,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:51:18,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:51:18,729 INFO L87 Difference]: Start difference. First operand 2925 states and 3846 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:51:19,354 INFO L93 Difference]: Finished difference Result 6701 states and 8822 transitions. [2025-02-06 00:51:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:51:19,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-02-06 00:51:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:51:19,366 INFO L225 Difference]: With dead ends: 6701 [2025-02-06 00:51:19,366 INFO L226 Difference]: Without dead ends: 3779 [2025-02-06 00:51:19,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:51:19,371 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 259 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:51:19,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 496 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:51:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2025-02-06 00:51:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 2961. [2025-02-06 00:51:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2492 states have (on average 1.3057784911717496) internal successors, (3254), 2492 states have internal predecessors, (3254), 320 states have call successors, (320), 148 states have call predecessors, (320), 148 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-02-06 00:51:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 3894 transitions. [2025-02-06 00:51:19,781 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 3894 transitions. Word has length 276 [2025-02-06 00:51:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:51:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 2961 states and 3894 transitions. [2025-02-06 00:51:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 3894 transitions. [2025-02-06 00:51:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-06 00:51:19,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:51:19,783 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:51:19,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 00:51:19,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:51:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:51:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 758088254, now seen corresponding path program 1 times [2025-02-06 00:51:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:51:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800205366] [2025-02-06 00:51:19,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:51:19,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-06 00:51:19,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-06 00:51:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:51:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:51:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800205366] [2025-02-06 00:51:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800205366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:51:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:51:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:51:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574440515] [2025-02-06 00:51:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:51:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:51:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:51:19,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:51:19,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:51:19,857 INFO L87 Difference]: Start difference. First operand 2961 states and 3894 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:51:20,114 INFO L93 Difference]: Finished difference Result 2963 states and 3895 transitions. [2025-02-06 00:51:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:51:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-02-06 00:51:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:51:20,123 INFO L225 Difference]: With dead ends: 2963 [2025-02-06 00:51:20,123 INFO L226 Difference]: Without dead ends: 1517 [2025-02-06 00:51:20,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:51:20,125 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:51:20,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:51:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-06 00:51:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2025-02-06 00:51:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1280 states have (on average 1.275) internal successors, (1632), 1280 states have internal predecessors, (1632), 160 states have call successors, (160), 76 states have call predecessors, (160), 76 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-02-06 00:51:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1952 transitions. [2025-02-06 00:51:20,372 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1952 transitions. Word has length 276 [2025-02-06 00:51:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:51:20,372 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1952 transitions. [2025-02-06 00:51:20,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1952 transitions. [2025-02-06 00:51:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-06 00:51:20,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:51:20,373 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:51:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 00:51:20,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:51:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:51:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1893273844, now seen corresponding path program 1 times [2025-02-06 00:51:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:51:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527475991] [2025-02-06 00:51:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:51:20,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-06 00:51:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-06 00:51:20,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:20,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 00:51:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:51:20,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527475991] [2025-02-06 00:51:20,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527475991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:51:20,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:51:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:51:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094778563] [2025-02-06 00:51:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:51:20,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:51:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:51:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:51:20,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:51:20,590 INFO L87 Difference]: Start difference. First operand 1517 states and 1952 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:51:20,990 INFO L93 Difference]: Finished difference Result 3373 states and 4381 transitions. [2025-02-06 00:51:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:51:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 278 [2025-02-06 00:51:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:51:20,998 INFO L225 Difference]: With dead ends: 3373 [2025-02-06 00:51:20,998 INFO L226 Difference]: Without dead ends: 1859 [2025-02-06 00:51:21,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:51:21,000 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 225 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:51:21,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:51:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-02-06 00:51:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1541. [2025-02-06 00:51:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1304 states have (on average 1.2699386503067485) internal successors, (1656), 1304 states have internal predecessors, (1656), 160 states have call successors, (160), 76 states have call predecessors, (160), 76 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-02-06 00:51:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1976 transitions. [2025-02-06 00:51:21,248 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1976 transitions. Word has length 278 [2025-02-06 00:51:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:51:21,248 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1976 transitions. [2025-02-06 00:51:21,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-06 00:51:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1976 transitions. [2025-02-06 00:51:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-06 00:51:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:51:21,250 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:51:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 00:51:21,250 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:51:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:51:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash 324484109, now seen corresponding path program 1 times [2025-02-06 00:51:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:51:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589788219] [2025-02-06 00:51:21,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:51:21,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-06 00:51:21,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-06 00:51:21,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:21,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:51:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157473043] [2025-02-06 00:51:21,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:51:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:51:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:51:21,335 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-06 00:51:21,337 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-06 00:51:21,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-06 00:51:21,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-06 00:51:21,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:51:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:51:21,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 00:51:21,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:51:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2173 proven. 126 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2025-02-06 00:51:22,273 INFO L312 TraceCheckSpWp]: Computing backward predicates...