./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1230.c --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/float-newlib/double_req_bl_1230.c -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 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:04:16,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:04:16,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 13:04:16,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:04:16,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:04:16,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:04:16,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:04:16,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:04:16,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:04:16,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:04:16,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:04:16,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:04:16,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:04:16,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:04:16,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:04:16,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:04:16,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:04:16,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:16,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:04:16,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:04:16,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:04:16,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:04:16,314 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 -> 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 [2025-02-05 13:04:16,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:04:16,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:04:16,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:04:16,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:04:16,533 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:04:16,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2025-02-05 13:04:17,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d353438d/642b050f75934219bcf6ec85b59c64fd/FLAG58a3be4b7 [2025-02-05 13:04:17,996 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:04:17,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2025-02-05 13:04:18,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d353438d/642b050f75934219bcf6ec85b59c64fd/FLAG58a3be4b7 [2025-02-05 13:04:18,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d353438d/642b050f75934219bcf6ec85b59c64fd [2025-02-05 13:04:18,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:04:18,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:04:18,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:18,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:04:18,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:04:18,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fffc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18, skipping insertion in model container [2025-02-05 13:04:18,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:04:18,171 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/float-newlib/double_req_bl_1230.c[1667,1680] [2025-02-05 13:04:18,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:18,180 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:04:18,198 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/float-newlib/double_req_bl_1230.c[1667,1680] [2025-02-05 13:04:18,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:18,215 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:04:18,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18 WrapperNode [2025-02-05 13:04:18,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:18,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:18,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:04:18,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:04:18,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,238 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2025-02-05 13:04:18,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:18,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:04:18,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:04:18,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:04:18,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,266 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-05 13:04:18,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:04:18,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:04:18,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:04:18,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:04:18,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (1/1) ... [2025-02-05 13:04:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:18,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:04:18,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 13:04:18,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 13:04:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-02-05 13:04:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:04:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 13:04:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:04:18,377 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:04:18,378 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:04:18,497 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 13:04:18,497 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:04:18,503 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:04:18,503 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:04:18,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:18 BoogieIcfgContainer [2025-02-05 13:04:18,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:04:18,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:04:18,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:04:18,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:04:18,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:04:18" (1/3) ... [2025-02-05 13:04:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48876773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:18, skipping insertion in model container [2025-02-05 13:04:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:18" (2/3) ... [2025-02-05 13:04:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48876773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:18, skipping insertion in model container [2025-02-05 13:04:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:18" (3/3) ... [2025-02-05 13:04:18,510 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2025-02-05 13:04:18,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:04:18,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1230.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 13:04:18,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:04:18,562 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;@7ce27f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:04:18,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 13:04:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 13:04:18,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:18,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:18,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:18,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash -880827635, now seen corresponding path program 1 times [2025-02-05 13:04:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 13:04:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110660660] [2025-02-05 13:04:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 13:04:18,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 13:04:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 13:04:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:18,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:18,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 13:04:18,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 13:04:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 13:04:18,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:18,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:18,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 13:04:18,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 13:04:18,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 2 remaining) [2025-02-05 13:04:18,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-05 13:04:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 13:04:18,665 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-05 13:04:18,677 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:04:18,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:04:18 BoogieIcfgContainer [2025-02-05 13:04:18,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:04:18,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:04:18,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:04:18,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:04:18,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:18" (3/4) ... [2025-02-05 13:04:18,686 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 13:04:18,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:04:18,687 INFO L158 Benchmark]: Toolchain (without parser) took 666.40ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 69.8MB in the end (delta: 40.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 13:04:18,687 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:18,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.32ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 99.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:18,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.33ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:18,688 INFO L158 Benchmark]: Boogie Preprocessor took 34.35ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:18,689 INFO L158 Benchmark]: IcfgBuilder took 228.99ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 82.3MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:18,689 INFO L158 Benchmark]: TraceAbstraction took 176.80ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 69.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 13:04:18,690 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:18,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.32ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 99.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.33ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.35ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 228.99ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 82.3MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 176.80ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 69.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 23]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 23. Possible FailurePath: [L63] double x = 0.0 / 0.0; [L64] double y = 0.0 / 0.0; [L65] CALL fmin_double(x, y) [L47] CALL __fpclassify_double(x) VAL [\old(x)=55] [L20] __uint32_t msw, lsw; VAL [\old(x)=55] [L27] COND TRUE 0 VAL [\old(x)=55] [L23] ieee_double_shape_type ew_u; VAL [\old(x)=55] - UnprovableResult [Line: 68]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 13:04:18,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/float-newlib/double_req_bl_1230.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:04:20,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:04:20,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 13:04:20,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:04:20,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:04:20,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:04:20,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:04:20,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:04:20,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:04:20,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:04:20,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:04:20,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:04:20,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:04:20,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:04:20,915 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:04:20,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 13:04:20,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 13:04:20,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 13:04:20,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:04:20,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:04:20,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:04:20,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:20,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 13:04:20,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 13:04:20,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:04:20,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:04:20,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:04:20,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:04:20,919 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 -> 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 [2025-02-05 13:04:21,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:04:21,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:04:21,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:04:21,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:04:21,192 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:04:21,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2025-02-05 13:04:22,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0404080/1480d9e6d4004a768ad38efba2882492/FLAGec5e91482 [2025-02-05 13:04:22,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:04:22,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2025-02-05 13:04:22,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0404080/1480d9e6d4004a768ad38efba2882492/FLAGec5e91482 [2025-02-05 13:04:22,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0404080/1480d9e6d4004a768ad38efba2882492 [2025-02-05 13:04:22,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:04:22,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:04:22,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:22,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:04:22,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:04:22,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b2044a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22, skipping insertion in model container [2025-02-05 13:04:22,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:04:22,771 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/float-newlib/double_req_bl_1230.c[1667,1680] [2025-02-05 13:04:22,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:22,784 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:04:22,802 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/float-newlib/double_req_bl_1230.c[1667,1680] [2025-02-05 13:04:22,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:22,816 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:04:22,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22 WrapperNode [2025-02-05 13:04:22,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:22,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:22,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:04:22,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:04:22,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,851 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2025-02-05 13:04:22,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:22,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:04:22,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:04:22,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:04:22,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,873 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-05 13:04:22,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:04:22,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:04:22,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:04:22,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:04:22,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (1/1) ... [2025-02-05 13:04:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:04:22,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 13:04:22,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:04:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-02-05 13:04:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-02-05 13:04:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 13:04:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 13:04:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:04:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:04:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:04:23,014 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:04:23,016 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:04:23,209 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 13:04:23,209 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:04:23,216 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:04:23,218 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:04:23,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:23 BoogieIcfgContainer [2025-02-05 13:04:23,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:04:23,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:04:23,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:04:23,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:04:23,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:04:22" (1/3) ... [2025-02-05 13:04:23,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d30e8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:23, skipping insertion in model container [2025-02-05 13:04:23,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:22" (2/3) ... [2025-02-05 13:04:23,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d30e8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:23, skipping insertion in model container [2025-02-05 13:04:23,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:23" (3/3) ... [2025-02-05 13:04:23,228 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2025-02-05 13:04:23,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:04:23,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1230.c that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 13:04:23,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:04:23,287 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;@a3f3420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:04:23,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 13:04:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 13:04:23,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:23,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:23,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1595848726, now seen corresponding path program 1 times [2025-02-05 13:04:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772939584] [2025-02-05 13:04:23,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:23,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:23,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 13:04:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 13:04:23,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 13:04:23,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:23,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:23,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 13:04:23,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:23,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:23,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772939584] [2025-02-05 13:04:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772939584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 13:04:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58897333] [2025-02-05 13:04:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 13:04:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:23,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 13:04:23,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 13:04:23,442 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:23,452 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2025-02-05 13:04:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 13:04:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-05 13:04:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:23,458 INFO L225 Difference]: With dead ends: 43 [2025-02-05 13:04:23,458 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 13:04:23,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 13:04:23,461 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:23,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 13:04:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 13:04:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-02-05 13:04:23,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2025-02-05 13:04:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:23,485 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-02-05 13:04:23,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-02-05 13:04:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 13:04:23,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:23,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:23,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 13:04:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:23,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1406621602, now seen corresponding path program 1 times [2025-02-05 13:04:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:23,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009118176] [2025-02-05 13:04:23,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:23,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:23,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 13:04:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 13:04:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 13:04:23,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:23,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:23,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:23,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:23,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:23,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009118176] [2025-02-05 13:04:23,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009118176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:23,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511063906] [2025-02-05 13:04:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:23,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:23,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:23,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:23,794 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:23,823 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-02-05 13:04:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:23,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-05 13:04:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:23,826 INFO L225 Difference]: With dead ends: 28 [2025-02-05 13:04:23,826 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 13:04:23,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:23,827 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 13:04:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-05 13:04:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:04:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-02-05 13:04:23,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2025-02-05 13:04:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:23,832 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-05 13:04:23,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-02-05 13:04:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 13:04:23,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:23,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:23,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 13:04:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 860159718, now seen corresponding path program 1 times [2025-02-05 13:04:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698806924] [2025-02-05 13:04:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:24,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:24,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 13:04:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 13:04:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 13:04:24,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:24,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:24,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:24,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:24,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:24,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698806924] [2025-02-05 13:04:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698806924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553314343] [2025-02-05 13:04:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:24,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:24,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,147 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:24,186 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-02-05 13:04:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-05 13:04:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:24,189 INFO L225 Difference]: With dead ends: 31 [2025-02-05 13:04:24,189 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 13:04:24,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,190 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:24,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 13:04:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-02-05 13:04:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:04:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-02-05 13:04:24,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2025-02-05 13:04:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:24,194 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-05 13:04:24,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-02-05 13:04:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 13:04:24,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:24,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:24,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 13:04:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2132504833, now seen corresponding path program 1 times [2025-02-05 13:04:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651927627] [2025-02-05 13:04:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:24,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 13:04:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 13:04:24,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 13:04:24,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:24,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:24,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:24,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:24,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651927627] [2025-02-05 13:04:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651927627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143441521] [2025-02-05 13:04:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,525 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:24,550 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-02-05 13:04:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:24,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-05 13:04:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:24,552 INFO L225 Difference]: With dead ends: 31 [2025-02-05 13:04:24,552 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 13:04:24,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,552 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:24,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 13:04:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-02-05 13:04:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:04:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-02-05 13:04:24,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2025-02-05 13:04:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-05 13:04:24,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-02-05 13:04:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 13:04:24,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:24,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:24,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 13:04:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:24,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 646926563, now seen corresponding path program 1 times [2025-02-05 13:04:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:24,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517753069] [2025-02-05 13:04:24,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:24,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:24,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:24,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 13:04:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 13:04:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 13:04:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:24,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:24,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:24,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:24,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517753069] [2025-02-05 13:04:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517753069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115987895] [2025-02-05 13:04:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:24,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:24,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:24,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,845 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:24,873 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-02-05 13:04:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 13:04:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:24,874 INFO L225 Difference]: With dead ends: 31 [2025-02-05 13:04:24,874 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 13:04:24,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:24,875 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:24,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 13:04:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-02-05 13:04:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:04:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-02-05 13:04:24,878 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2025-02-05 13:04:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:24,878 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-05 13:04:24,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-02-05 13:04:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 13:04:24,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:24,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:24,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-05 13:04:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1905230398, now seen corresponding path program 1 times [2025-02-05 13:04:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061309398] [2025-02-05 13:04:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:25,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:25,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:25,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 13:04:25,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 13:04:25,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 13:04:25,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:25,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:25,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 13:04:25,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:04:25,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:25,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061309398] [2025-02-05 13:04:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061309398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287768900] [2025-02-05 13:04:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:25,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:25,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:25,250 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:25,327 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-02-05 13:04:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 13:04:25,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 13:04:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:25,328 INFO L225 Difference]: With dead ends: 28 [2025-02-05 13:04:25,328 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 13:04:25,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:25,328 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:25,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:04:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 13:04:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-02-05 13:04:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-05 13:04:25,331 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2025-02-05 13:04:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:25,331 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-05 13:04:25,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-05 13:04:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 13:04:25,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:25,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:25,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-05 13:04:25,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:25,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1069019303, now seen corresponding path program 1 times [2025-02-05 13:04:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926071215] [2025-02-05 13:04:25,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:25,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:25,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:25,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-05 13:04:25,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 13:04:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 13:04:25,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:25,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:25,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:25,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:25,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926071215] [2025-02-05 13:04:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926071215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197871396] [2025-02-05 13:04:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:25,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:25,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:25,647 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:25,678 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-02-05 13:04:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-05 13:04:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:25,679 INFO L225 Difference]: With dead ends: 28 [2025-02-05 13:04:25,679 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 13:04:25,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:25,680 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:25,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 13:04:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-05 13:04:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 13:04:25,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 22 [2025-02-05 13:04:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 13:04:25,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 13:04:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 13:04:25,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:25,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:25,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-05 13:04:25,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:25,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 840700251, now seen corresponding path program 1 times [2025-02-05 13:04:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805382968] [2025-02-05 13:04:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:25,892 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:25,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-05 13:04:25,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 13:04:25,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 13:04:25,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:25,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:25,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:25,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:25,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:25,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:25,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805382968] [2025-02-05 13:04:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805382968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:25,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:25,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704832267] [2025-02-05 13:04:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:25,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:25,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:25,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:25,976 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:26,000 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-05 13:04:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-05 13:04:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:26,001 INFO L225 Difference]: With dead ends: 30 [2025-02-05 13:04:26,001 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 13:04:26,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:26,001 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:26,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 13:04:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-05 13:04:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 13:04:26,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2025-02-05 13:04:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:26,004 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 13:04:26,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 13:04:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 13:04:26,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:26,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:26,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-05 13:04:26,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:26,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -879471100, now seen corresponding path program 1 times [2025-02-05 13:04:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337672720] [2025-02-05 13:04:26,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:26,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:26,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-05 13:04:26,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 13:04:26,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 13:04:26,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:26,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:26,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:26,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:26,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:26,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:26,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337672720] [2025-02-05 13:04:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337672720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410479614] [2025-02-05 13:04:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:26,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:26,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:26,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:26,322 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:26,357 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-05 13:04:26,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:26,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-05 13:04:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:26,359 INFO L225 Difference]: With dead ends: 30 [2025-02-05 13:04:26,359 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 13:04:26,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:26,359 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 13:04:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-05 13:04:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 13:04:26,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2025-02-05 13:04:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:26,364 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 13:04:26,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 13:04:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 13:04:26,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:26,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:26,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-05 13:04:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1602423464, now seen corresponding path program 1 times [2025-02-05 13:04:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756509107] [2025-02-05 13:04:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:26,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:26,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-05 13:04:26,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 13:04:26,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 13:04:26,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:26,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:26,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:26,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:26,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:26,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756509107] [2025-02-05 13:04:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756509107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269253555] [2025-02-05 13:04:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:26,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:26,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:26,703 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:26,725 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-05 13:04:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-05 13:04:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:26,725 INFO L225 Difference]: With dead ends: 30 [2025-02-05 13:04:26,726 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 13:04:26,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:26,726 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:26,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 13:04:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-05 13:04:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 13:04:26,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2025-02-05 13:04:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:26,730 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 13:04:26,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 13:04:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 13:04:26,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:26,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:26,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-05 13:04:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 140386871, now seen corresponding path program 1 times [2025-02-05 13:04:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916610155] [2025-02-05 13:04:26,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:26,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:04:26,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-05 13:04:26,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 13:04:27,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 13:04:27,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:27,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:27,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 13:04:27,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 13:04:27,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:27,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:27,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916610155] [2025-02-05 13:04:27,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916610155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:27,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:27,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:27,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449279064] [2025-02-05 13:04:27,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:27,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:27,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:27,104 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:27,144 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-02-05 13:04:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 13:04:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-05 13:04:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:27,145 INFO L225 Difference]: With dead ends: 22 [2025-02-05 13:04:27,145 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 13:04:27,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:27,145 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-05 13:04:27,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 13:04:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 13:04:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 13:04:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 13:04:27,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-02-05 13:04:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:27,146 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 13:04:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 13:04:27,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 13:04:27,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 13:04:27,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-02-05 13:04:27,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:04:27,351 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:27,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 13:04:27,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:04:27,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:04:27 BoogieIcfgContainer [2025-02-05 13:04:27,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:04:27,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:04:27,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:04:27,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:04:27,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:23" (3/4) ... [2025-02-05 13:04:27,408 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 13:04:27,412 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2025-02-05 13:04:27,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-05 13:04:27,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-05 13:04:27,415 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 13:04:27,415 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 13:04:27,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 13:04:27,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 13:04:27,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:04:27,466 INFO L158 Benchmark]: Toolchain (without parser) took 4831.47ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 58.0MB in the end (delta: 34.2MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-02-05 13:04:27,466 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:27,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.82ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 80.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:27,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.49ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:27,467 INFO L158 Benchmark]: Boogie Preprocessor took 38.20ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:27,467 INFO L158 Benchmark]: IcfgBuilder took 327.50ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 63.8MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:27,467 INFO L158 Benchmark]: TraceAbstraction took 4184.88ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 63.9MB in the end (delta: -542.7kB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-02-05 13:04:27,467 INFO L158 Benchmark]: Witness Printer took 59.50ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:27,468 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.82ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 80.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.49ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.20ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.50ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 63.8MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4184.88ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 63.9MB in the end (delta: -542.7kB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 59.50ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 68]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 285 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 8 QuantifiedInterpolants, 304 SizeOfPredicates, 2 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 13:04:27,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE