./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.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-while_file-14.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 a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:55:23,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:55:23,598 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:55:23,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:55:23,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:55:23,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:55:23,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:55:23,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:55:23,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:55:23,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:55:23,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:55:23,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:55:23,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:55:23,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:55:23,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:55:23,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:55:23,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:55:23,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:55:23,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:55:23,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:55:23,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:55:23,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:55:23,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:55:23,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:55:23,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:55:23,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:55:23,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:55:23,626 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 -> a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b [2025-02-06 00:55:23,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:55:23,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:55:23,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:55:23,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:55:23,866 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:55:23,867 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-while_file-14.i [2025-02-06 00:55:24,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbbcee3f6/11e5b7820dc84f86a0860fb3f0537756/FLAGee2b57eeb [2025-02-06 00:55:25,209 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:55:25,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i [2025-02-06 00:55:25,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbbcee3f6/11e5b7820dc84f86a0860fb3f0537756/FLAGee2b57eeb [2025-02-06 00:55:25,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbbcee3f6/11e5b7820dc84f86a0860fb3f0537756 [2025-02-06 00:55:25,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:55:25,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:55:25,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:55:25,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:55:25,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:55:25,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3278185d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25, skipping insertion in model container [2025-02-06 00:55:25,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:55:25,648 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-while_file-14.i[916,929] [2025-02-06 00:55:25,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:55:25,739 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:55:25,748 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-while_file-14.i[916,929] [2025-02-06 00:55:25,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:55:25,803 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:55:25,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25 WrapperNode [2025-02-06 00:55:25,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:55:25,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:55:25,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:55:25,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:55:25,810 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:55:25" (1/1) ... [2025-02-06 00:55:25,818 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:55:25" (1/1) ... [2025-02-06 00:55:25,861 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2025-02-06 00:55:25,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:55:25,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:55:25,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:55:25,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:55:25,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,896 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:55:25,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:55:25,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:55:25,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:55:25,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:55:25,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (1/1) ... [2025-02-06 00:55:25,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:55:25,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:55:25,952 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:55:25,954 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:55:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:55:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:55:25,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:55:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:55:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:55:25,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:55:26,047 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:55:26,049 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:55:26,458 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~bitwise26#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-02-06 00:55:26,492 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-06 00:55:26,493 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:55:26,513 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:55:26,514 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:55:26,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:55:26 BoogieIcfgContainer [2025-02-06 00:55:26,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:55:26,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:55:26,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:55:26,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:55:26,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:55:25" (1/3) ... [2025-02-06 00:55:26,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e13c281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:55:26, skipping insertion in model container [2025-02-06 00:55:26,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:55:25" (2/3) ... [2025-02-06 00:55:26,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e13c281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:55:26, skipping insertion in model container [2025-02-06 00:55:26,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:55:26" (3/3) ... [2025-02-06 00:55:26,523 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-14.i [2025-02-06 00:55:26,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:55:26,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-14.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:55:26,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:55:26,589 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;@2b7d2f7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:55:26,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:55:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 00:55:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-06 00:55:26,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:55:26,601 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:55:26,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:55:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 869343971, now seen corresponding path program 1 times [2025-02-06 00:55:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:55:26,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32875385] [2025-02-06 00:55:26,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:55:26,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 00:55:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 00:55:26,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:55:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 00:55:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:55:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32875385] [2025-02-06 00:55:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32875385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:55:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031485517] [2025-02-06 00:55:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:55:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:55:26,935 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:55:26,936 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:55:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 00:55:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 00:55:27,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:27,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:55:27,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:55:27,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:55:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 00:55:27,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:55:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031485517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:55:27,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:55:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:55:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323644905] [2025-02-06 00:55:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:55:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:55:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:55:27,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:55:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:55:27,153 INFO L87 Difference]: Start difference. First operand has 114 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 00:55:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:55:27,192 INFO L93 Difference]: Finished difference Result 221 states and 382 transitions. [2025-02-06 00:55:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:55:27,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-06 00:55:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:55:27,199 INFO L225 Difference]: With dead ends: 221 [2025-02-06 00:55:27,201 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 00:55:27,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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:55:27,205 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:55:27,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:55:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 00:55:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 00:55:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 00:55:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2025-02-06 00:55:27,244 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 202 [2025-02-06 00:55:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:55:27,244 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2025-02-06 00:55:27,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 00:55:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2025-02-06 00:55:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-06 00:55:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:55:27,251 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,261 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:55:27,454 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:55:27,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:55:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:55:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -760858556, now seen corresponding path program 1 times [2025-02-06 00:55:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:55:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056902742] [2025-02-06 00:55:27,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:55:27,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 00:55:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 00:55:27,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:27,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:55:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:55:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:55:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056902742] [2025-02-06 00:55:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056902742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:55:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:55:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:55:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887223659] [2025-02-06 00:55:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:55:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:55:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:55:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:55:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:55:27,863 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:55:27,919 INFO L93 Difference]: Finished difference Result 218 states and 341 transitions. [2025-02-06 00:55:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:55:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-06 00:55:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:55:27,921 INFO L225 Difference]: With dead ends: 218 [2025-02-06 00:55:27,922 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 00:55:27,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:55:27,923 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:55:27,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 479 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:55:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 00:55:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 00:55:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 00:55:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-02-06 00:55:27,936 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 202 [2025-02-06 00:55:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:55:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-02-06 00:55:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-02-06 00:55:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 00:55:27,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:55:27,939 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:55:27,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:55:27,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:55:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1900261257, now seen corresponding path program 1 times [2025-02-06 00:55:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:55:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777465482] [2025-02-06 00:55:27,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:55:27,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 00:55:28,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 00:55:28,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:28,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:55:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:55:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:55:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777465482] [2025-02-06 00:55:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777465482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:55:29,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:55:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:55:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795559895] [2025-02-06 00:55:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:55:29,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:55:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:55:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:55:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:55:29,865 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:55:30,718 INFO L93 Difference]: Finished difference Result 376 states and 578 transitions. [2025-02-06 00:55:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:55:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-06 00:55:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:55:30,722 INFO L225 Difference]: With dead ends: 376 [2025-02-06 00:55:30,722 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 00:55:30,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:55:30,723 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 660 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:55:30,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 698 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 00:55:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 00:55:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2025-02-06 00:55:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 174 states have (on average 1.4022988505747127) internal successors, (244), 175 states have internal predecessors, (244), 64 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 00:55:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 372 transitions. [2025-02-06 00:55:30,765 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 372 transitions. Word has length 203 [2025-02-06 00:55:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:55:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 372 transitions. [2025-02-06 00:55:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 372 transitions. [2025-02-06 00:55:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 00:55:30,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:55:30,769 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:55:30,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:55:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:55:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 176948086, now seen corresponding path program 1 times [2025-02-06 00:55:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:55:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711665868] [2025-02-06 00:55:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:55:30,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 00:55:30,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 00:55:30,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:30,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:55:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:55:31,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:55:31,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711665868] [2025-02-06 00:55:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711665868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:55:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:55:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:55:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149028203] [2025-02-06 00:55:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:55:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:55:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:55:31,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:55:31,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:55:31,479 INFO L87 Difference]: Start difference. First operand 242 states and 372 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:55:31,672 INFO L93 Difference]: Finished difference Result 355 states and 545 transitions. [2025-02-06 00:55:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:55:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-06 00:55:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:55:31,675 INFO L225 Difference]: With dead ends: 355 [2025-02-06 00:55:31,675 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 00:55:31,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:55:31,676 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 136 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:55:31,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 423 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:55:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 00:55:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 228. [2025-02-06 00:55:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 159 states have (on average 1.371069182389937) internal successors, (218), 160 states have internal predecessors, (218), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 00:55:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 346 transitions. [2025-02-06 00:55:31,703 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 346 transitions. Word has length 203 [2025-02-06 00:55:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:55:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 346 transitions. [2025-02-06 00:55:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:55:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 346 transitions. [2025-02-06 00:55:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-06 00:55:31,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:55:31,705 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:55:31,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:55:31,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:55:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1896082763, now seen corresponding path program 1 times [2025-02-06 00:55:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:55:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125087859] [2025-02-06 00:55:31,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:55:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:55:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-06 00:55:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-06 00:55:31,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:55:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:56:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 75 proven. 177 refuted. 0 times theorem prover too weak. 1608 trivial. 0 not checked. [2025-02-06 00:56:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:56:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125087859] [2025-02-06 00:56:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125087859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:56:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833375441] [2025-02-06 00:56:11,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:56:11,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:56:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:56:11,888 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:56:11,890 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:56:11,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-06 00:56:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-06 00:56:12,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:56:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:56:12,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 00:56:12,384 INFO L279 TraceCheckSpWp]: Computing forward predicates...