./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:13:38,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:13:38,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 16:13:38,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:13:38,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:13:38,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:13:38,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:13:38,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:13:38,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:13:38,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:13:38,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:13:38,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:13:38,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:13:38,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:13:38,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:13:38,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:13:38,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:13:38,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:38,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:13:38,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:13:38,397 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/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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2025-03-16 16:13:38,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:13:38,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:13:38,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:13:38,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:13:38,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:13:38,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2025-03-16 16:13:39,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ba0db6d/5d0392248f6c42e0a3dfcbd04e1d44ef/FLAG556817252 [2025-03-16 16:13:40,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:13:40,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2025-03-16 16:13:40,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ba0db6d/5d0392248f6c42e0a3dfcbd04e1d44ef/FLAG556817252 [2025-03-16 16:13:40,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ba0db6d/5d0392248f6c42e0a3dfcbd04e1d44ef [2025-03-16 16:13:40,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:13:40,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:13:40,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:40,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:13:40,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:13:40,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd17199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40, skipping insertion in model container [2025-03-16 16:13:40,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:13:40,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2025-03-16 16:13:40,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:40,182 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:13:40,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2025-03-16 16:13:40,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:40,219 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:13:40,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40 WrapperNode [2025-03-16 16:13:40,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:40,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:40,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:13:40,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:13:40,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,242 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2025-03-16 16:13:40,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:40,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:13:40,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:13:40,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:13:40,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,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-03-16 16:13:40,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:13:40,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:13:40,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:13:40,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:13:40,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (1/1) ... [2025-03-16 16:13:40,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:40,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:13:40,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:13:40,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:13:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-16 16:13:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-16 16:13:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:13:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:13:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 16:13:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 16:13:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:13:40,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:13:40,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:13:40,523 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-16 16:13:40,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:13:40,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:13:40,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 16:13:40,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:40 BoogieIcfgContainer [2025-03-16 16:13:40,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:13:40,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:13:40,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:13:40,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:13:40,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:13:40" (1/3) ... [2025-03-16 16:13:40,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1246a204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:40, skipping insertion in model container [2025-03-16 16:13:40,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:40" (2/3) ... [2025-03-16 16:13:40,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1246a204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:40, skipping insertion in model container [2025-03-16 16:13:40,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:40" (3/3) ... [2025-03-16 16:13:40,542 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2025-03-16 16:13:40,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:13:40,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1251b.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-16 16:13:40,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:13:40,605 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;@26bcd6a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:13:40,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 16:13:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.65) internal successors, (33), 22 states have internal predecessors, (33), 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-03-16 16:13:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 16:13:40,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:40,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 16:13:40,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash 68653325, now seen corresponding path program 1 times [2025-03-16 16:13:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 16:13:40,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144293289] [2025-03-16 16:13:40,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 16:13:40,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 16:13:40,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 16:13:40,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:40,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:40,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 16:13:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 16:13:40,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 16:13:40,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:40,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:40,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 16:13:40,730 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 16:13:40,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 2 remaining) [2025-03-16 16:13:40,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-16 16:13:40,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 16:13:40,737 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-16 16:13:40,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:13:40,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:13:40 BoogieIcfgContainer [2025-03-16 16:13:40,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:13:40,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:13:40,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:13:40,752 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:13:40,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:40" (3/4) ... [2025-03-16 16:13:40,754 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 16:13:40,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:13:40,755 INFO L158 Benchmark]: Toolchain (without parser) took 724.56ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 81.2MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 16:13:40,755 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:40,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.98ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 111.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:40,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.52ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:40,757 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:40,758 INFO L158 Benchmark]: IcfgBuilder took 253.35ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 94.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:40,758 INFO L158 Benchmark]: TraceAbstraction took 214.86ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 81.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 16:13:40,758 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 81.2MB in the end (delta: 408.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:40,760 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.26ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.98ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 111.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.52ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 253.35ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 94.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 214.86ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 81.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 81.2MB in the end (delta: 408.8kB). 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: 32]: 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 67, overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 18. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L74] CALL, EXPR isnan_double(x) [L18] return x != x; [L74] RET, EXPR isnan_double(x) [L74] COND TRUE !isnan_double(x) [L76] CALL fmax_double(x, y) [L57] CALL __fpclassify_double(x) VAL [\old(x)=55] [L29] __uint32_t msw, lsw; VAL [\old(x)=55] [L32] ieee_double_shape_type ew_u; VAL [\old(x)=55] - UnprovableResult [Line: 80]: 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, 26 locations, 39 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, 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=26occurred 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, 5 NumberOfCodeBlocks, 5 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-03-16 16:13:40,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:13:42,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:13:42,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 16:13:42,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:13:42,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:13:42,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:13:42,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:13:42,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:13:42,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:13:42,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:13:42,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:13:42,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:13:42,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:13:42,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:13:42,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:13:42,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:13:42,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:13:42,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:13:42,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:13:42,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:13:42,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:13:42,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:42,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:13:42,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:13:42,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:13:42,758 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/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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2025-03-16 16:13:42,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:13:43,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:13:43,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:13:43,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:13:43,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:13:43,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2025-03-16 16:13:44,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bb28879/0d140eef80f74fe6988f5ec0161af37d/FLAG5eeb9a8e3 [2025-03-16 16:13:44,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:13:44,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2025-03-16 16:13:44,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bb28879/0d140eef80f74fe6988f5ec0161af37d/FLAG5eeb9a8e3 [2025-03-16 16:13:44,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bb28879/0d140eef80f74fe6988f5ec0161af37d [2025-03-16 16:13:44,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:13:44,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:13:44,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:44,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:13:44,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:13:44,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291b22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44, skipping insertion in model container [2025-03-16 16:13:44,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:13:44,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2025-03-16 16:13:44,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:44,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:13:44,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2025-03-16 16:13:44,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:44,574 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:13:44,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44 WrapperNode [2025-03-16 16:13:44,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:44,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:44,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:13:44,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:13:44,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,598 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-03-16 16:13:44,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:44,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:13:44,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:13:44,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:13:44,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,613 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-03-16 16:13:44,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:13:44,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:13:44,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:13:44,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:13:44,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (1/1) ... [2025-03-16 16:13:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:13:44,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:13:44,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:13:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-16 16:13:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-16 16:13:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-16 16:13:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-16 16:13:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:13:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:13:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:13:44,719 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:13:44,720 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:13:44,902 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-16 16:13:44,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:13:44,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:13:44,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 16:13:44,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:44 BoogieIcfgContainer [2025-03-16 16:13:44,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:13:44,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:13:44,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:13:44,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:13:44,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:13:44" (1/3) ... [2025-03-16 16:13:44,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31448f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:44, skipping insertion in model container [2025-03-16 16:13:44,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:44" (2/3) ... [2025-03-16 16:13:44,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31448f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:44, skipping insertion in model container [2025-03-16 16:13:44,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:44" (3/3) ... [2025-03-16 16:13:44,920 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2025-03-16 16:13:44,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:13:44,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1251b.c that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 16:13:44,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:13:44,973 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;@190e8437, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:13:44,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 16:13:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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-03-16 16:13:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 16:13:44,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:44,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:44,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:44,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1718241750, now seen corresponding path program 1 times [2025-03-16 16:13:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367953250] [2025-03-16 16:13:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:44,996 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-03-16 16:13:44,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:44,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-16 16:13:44,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:45,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 16:13:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 16:13:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:45,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 16:13:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:45,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:45,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:45,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367953250] [2025-03-16 16:13:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367953250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:45,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 16:13:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411444927] [2025-03-16 16:13:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 16:13:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:45,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 16:13:45,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 16:13:45,126 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03-16 16:13:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:45,140 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2025-03-16 16:13:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 16:13:45,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2025-03-16 16:13:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:45,145 INFO L225 Difference]: With dead ends: 43 [2025-03-16 16:13:45,145 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 16:13:45,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-03-16 16:13:45,150 INFO L435 NwaCegarLoop]: 30 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, 30 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-03-16 16:13:45,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 16:13:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 16:13:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-03-16 16:13:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-16 16:13:45,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2025-03-16 16:13:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-16 16:13:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03-16 16:13:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-16 16:13:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 16:13:45,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:45,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:45,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:45,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-16 16:13:45,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:45,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -915022636, now seen corresponding path program 1 times [2025-03-16 16:13:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718355930] [2025-03-16 16:13:45,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:45,383 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-03-16 16:13:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:45,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-16 16:13:45,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:45,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 16:13:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 16:13:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:45,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:45,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:45,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:45,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718355930] [2025-03-16 16:13:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718355930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761669603] [2025-03-16 16:13:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:45,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:45,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:45,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:45,494 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-03-16 16:13:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:45,519 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-03-16 16:13:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-03-16 16:13:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:45,521 INFO L225 Difference]: With dead ends: 26 [2025-03-16 16:13:45,521 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 16:13:45,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-03-16 16:13:45,522 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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-03-16 16:13:45,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 16:13:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-16 16:13:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-03-16 16:13:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-16 16:13:45,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2025-03-16 16:13:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:45,527 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-16 16:13:45,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-03-16 16:13:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-16 16:13:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 16:13:45,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:45,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:45,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:45,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-16 16:13:45,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:45,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1895638034, now seen corresponding path program 1 times [2025-03-16 16:13:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984359190] [2025-03-16 16:13:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:45,729 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-03-16 16:13:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:45,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-16 16:13:45,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:45,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 16:13:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 16:13:45,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:45,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:45,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:45,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:45,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984359190] [2025-03-16 16:13:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984359190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045007854] [2025-03-16 16:13:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:45,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:45,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:45,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:45,809 INFO L87 Difference]: Start difference. First operand 22 states and 29 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-03-16 16:13:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:45,829 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2025-03-16 16:13:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:45,830 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-03-16 16:13:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:45,830 INFO L225 Difference]: With dead ends: 29 [2025-03-16 16:13:45,830 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 16:13:45,831 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-03-16 16:13:45,831 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-03-16 16:13:45,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 16:13:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-03-16 16:13:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-03-16 16:13:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-16 16:13:45,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 14 [2025-03-16 16:13:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-16 16:13:45,837 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-03-16 16:13:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-16 16:13:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 16:13:45,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:45,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:45,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-16 16:13:46,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:46,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash -533093993, now seen corresponding path program 1 times [2025-03-16 16:13:46,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:46,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594473995] [2025-03-16 16:13:46,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:46,039 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-03-16 16:13:46,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:46,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-16 16:13:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 16:13:46,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 16:13:46,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:46,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:46,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:46,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:46,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594473995] [2025-03-16 16:13:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594473995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696335045] [2025-03-16 16:13:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:46,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:46,112 INFO L87 Difference]: Start difference. First operand 22 states and 29 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-03-16 16:13:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:46,129 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2025-03-16 16:13:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:46,130 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-03-16 16:13:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:46,130 INFO L225 Difference]: With dead ends: 29 [2025-03-16 16:13:46,130 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 16:13:46,131 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-03-16 16:13:46,131 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-03-16 16:13:46,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 16:13:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-03-16 16:13:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-03-16 16:13:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-16 16:13:46,137 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 15 [2025-03-16 16:13:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:46,137 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-16 16:13:46,137 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-03-16 16:13:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-16 16:13:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 16:13:46,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:46,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:46,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-16 16:13:46,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:46,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash 452948625, now seen corresponding path program 1 times [2025-03-16 16:13:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153644005] [2025-03-16 16:13:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:46,339 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-03-16 16:13:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:46,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-16 16:13:46,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 16:13:46,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 16:13:46,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:46,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:46,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:46,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:46,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:46,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153644005] [2025-03-16 16:13:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153644005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130288206] [2025-03-16 16:13:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:46,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:46,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:46,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:46,420 INFO L87 Difference]: Start difference. First operand 22 states and 29 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-03-16 16:13:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:46,448 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2025-03-16 16:13:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:46,448 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-03-16 16:13:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:46,449 INFO L225 Difference]: With dead ends: 29 [2025-03-16 16:13:46,449 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 16:13:46,449 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-03-16 16:13:46,450 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-03-16 16:13:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 16:13:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-03-16 16:13:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-03-16 16:13:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-16 16:13:46,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 16 [2025-03-16 16:13:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-16 16:13:46,456 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-03-16 16:13:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-16 16:13:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 16:13:46,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:46,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:46,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-16 16:13:46,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1340452306, now seen corresponding path program 1 times [2025-03-16 16:13:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207639489] [2025-03-16 16:13:46,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:46,663 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-03-16 16:13:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:46,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-16 16:13:46,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:46,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 16:13:46,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 16:13:46,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:46,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 16:13:46,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:13:47,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:47,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207639489] [2025-03-16 16:13:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207639489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 16:13:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812103484] [2025-03-16 16:13:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 16:13:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:47,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 16:13:47,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:13:47,312 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-03-16 16:13:50,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 16:13:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:51,826 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2025-03-16 16:13:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 16:13:51,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-03-16 16:13:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:51,828 INFO L225 Difference]: With dead ends: 39 [2025-03-16 16:13:51,828 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 16:13:51,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-16 16:13:51,828 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:51,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 16:13:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 16:13:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 16:13:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 17 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-03-16 16:13:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-16 16:13:51,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2025-03-16 16:13:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:51,832 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-16 16:13:51,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-03-16 16:13:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-16 16:13:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 16:13:51,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:51,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:51,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:52,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-16 16:13:52,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:52,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -794183472, now seen corresponding path program 1 times [2025-03-16 16:13:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380204176] [2025-03-16 16:13:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:52,037 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-03-16 16:13:52,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:52,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-16 16:13:52,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:52,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 16:13:52,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 16:13:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:52,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:52,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 16:13:52,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:52,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380204176] [2025-03-16 16:13:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380204176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359819766] [2025-03-16 16:13:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:52,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:52,121 INFO L87 Difference]: Start difference. First operand 21 states and 26 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, (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-03-16 16:13:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:52,144 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-03-16 16:13:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:52,144 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, (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 21 [2025-03-16 16:13:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:52,145 INFO L225 Difference]: With dead ends: 28 [2025-03-16 16:13:52,145 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 16:13:52,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-03-16 16:13:52,146 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 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-03-16 16:13:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 16:13:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-16 16:13:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 16:13:52,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 21 [2025-03-16 16:13:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:52,149 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 16:13:52,149 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, (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-03-16 16:13:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 16:13:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 16:13:52,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:52,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:52,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:52,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-16 16:13:52,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:52,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash -794123890, now seen corresponding path program 1 times [2025-03-16 16:13:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609847088] [2025-03-16 16:13:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:52,351 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-03-16 16:13:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:52,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-16 16:13:52,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 16:13:52,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 16:13:52,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:52,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 16:13:52,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:13:52,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:52,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609847088] [2025-03-16 16:13:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609847088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:52,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 16:13:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325685435] [2025-03-16 16:13:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 16:13:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:52,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 16:13:52,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 16:13:52,591 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-03-16 16:13:55,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 16:13:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:55,207 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-16 16:13:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 16:13:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 21 [2025-03-16 16:13:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:55,208 INFO L225 Difference]: With dead ends: 29 [2025-03-16 16:13:55,208 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 16:13:55,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:13:55,209 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:55,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 16:13:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 16:13:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-16 16:13:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 16:13:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 16:13:55,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 21 [2025-03-16 16:13:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:55,213 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 16:13:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-03-16 16:13:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 16:13:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 16:13:55,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:55,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:55,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:55,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-03-16 16:13:55,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1910255960, now seen corresponding path program 1 times [2025-03-16 16:13:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766244861] [2025-03-16 16:13:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:55,418 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-03-16 16:13:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:55,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-03-16 16:13:55,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:55,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 16:13:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 16:13:55,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:55,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:55,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:55,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 16:13:55,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:55,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766244861] [2025-03-16 16:13:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766244861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769348656] [2025-03-16 16:13:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:55,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:55,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:55,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:55,500 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-03-16 16:13:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:55,521 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-16 16:13:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:55,521 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-03-16 16:13:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:55,522 INFO L225 Difference]: With dead ends: 30 [2025-03-16 16:13:55,522 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 16:13:55,522 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-03-16 16:13:55,522 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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-03-16 16:13:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 16:13:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-16 16:13:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 16:13:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-16 16:13:55,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 22 [2025-03-16 16:13:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:55,527 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-16 16:13:55,527 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-03-16 16:13:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-16 16:13:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 16:13:55,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:55,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:55,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-03-16 16:13:55,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1910315542, now seen corresponding path program 1 times [2025-03-16 16:13:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266304740] [2025-03-16 16:13:55,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:55,737 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-03-16 16:13:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:55,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-03-16 16:13:55,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:55,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 16:13:55,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 16:13:55,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:55,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 16:13:55,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:13:55,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:55,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:55,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266304740] [2025-03-16 16:13:55,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266304740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:55,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:55,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 16:13:55,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710711834] [2025-03-16 16:13:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:55,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 16:13:55,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:55,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 16:13:55,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 16:13:55,958 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-03-16 16:13:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:56,214 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-16 16:13:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 16:13:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 22 [2025-03-16 16:13:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:56,215 INFO L225 Difference]: With dead ends: 31 [2025-03-16 16:13:56,215 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 16:13:56,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:13:56,216 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:56,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 54 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 16:13:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 16:13:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-03-16 16:13:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 16:13:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 16:13:56,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 22 [2025-03-16 16:13:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:56,221 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 16:13:56,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-03-16 16:13:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 16:13:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 16:13:56,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:56,222 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-03-16 16:13:56,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-16 16:13:56,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-03-16 16:13:56,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:56,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1545382739, now seen corresponding path program 1 times [2025-03-16 16:13:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551389039] [2025-03-16 16:13:56,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:56,427 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-03-16 16:13:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:56,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-03-16 16:13:56,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:13:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 16:13:56,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 16:13:56,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:56,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:56,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 16:13:56,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:56,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551389039] [2025-03-16 16:13:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551389039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052630610] [2025-03-16 16:13:56,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:56,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:56,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:56,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:56,492 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-03-16 16:13:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:56,555 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-16 16:13:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:56,556 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-03-16 16:13:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:56,556 INFO L225 Difference]: With dead ends: 30 [2025-03-16 16:13:56,556 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 16:13:56,557 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-03-16 16:13:56,557 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:56,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 16:13:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 16:13:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-16 16:13:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 16:13:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-16 16:13:56,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2025-03-16 16:13:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:56,561 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-16 16:13:56,561 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-03-16 16:13:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-16 16:13:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 16:13:56,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:56,562 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-03-16 16:13:56,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-16 16:13:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-03-16 16:13:56,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1545442321, now seen corresponding path program 1 times [2025-03-16 16:13:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630519697] [2025-03-16 16:13:56,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:56,763 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-03-16 16:13:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:56,765 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-03-16 16:13:56,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Waiting until timeout for monitored process [2025-03-16 16:13:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 16:13:56,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 16:13:56,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:56,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:56,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 16:13:56,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:13:56,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:56,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630519697] [2025-03-16 16:13:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630519697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 16:13:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040985810] [2025-03-16 16:13:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 16:13:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 16:13:56,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 16:13:56,996 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-03-16 16:14:00,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 16:14:02,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 16:14:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:14:02,478 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-16 16:14:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 16:14:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-03-16 16:14:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:14:02,479 INFO L225 Difference]: With dead ends: 33 [2025-03-16 16:14:02,479 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 16:14:02,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:14:02,479 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-16 16:14:02,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-16 16:14:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 16:14:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-03-16 16:14:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 16:14:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 16:14:02,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 23 [2025-03-16 16:14:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:14:02,483 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 16:14:02,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-03-16 16:14:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 16:14:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 16:14:02,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:14:02,484 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-03-16 16:14:02,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Ended with exit code 0 [2025-03-16 16:14:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-03-16 16:14:02,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:14:02,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:14:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash 521097787, now seen corresponding path program 1 times [2025-03-16 16:14:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:14:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606632532] [2025-03-16 16:14:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:14:02,685 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-03-16 16:14:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:14:02,691 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-03-16 16:14:02,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Waiting until timeout for monitored process [2025-03-16 16:14:02,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:14:02,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:14:02,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:14:02,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:14:02,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:14:02,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:14:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 16:14:02,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:14:02,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:14:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606632532] [2025-03-16 16:14:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606632532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:14:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:14:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:14:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978618793] [2025-03-16 16:14:02,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:14:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:14:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:14:02,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:14:02,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:14:02,774 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-03-16 16:14:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:14:02,792 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-03-16 16:14:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:14:02,792 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-03-16 16:14:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:14:02,793 INFO L225 Difference]: With dead ends: 28 [2025-03-16 16:14:02,793 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 16:14:02,793 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-03-16 16:14:02,793 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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-03-16 16:14:02,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:14:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 16:14:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-16 16:14:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 16:14:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-16 16:14:02,796 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 24 [2025-03-16 16:14:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:14:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-16 16:14:02,796 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-03-16 16:14:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-16 16:14:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 16:14:02,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:14:02,797 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-03-16 16:14:02,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Ended with exit code 0 [2025-03-16 16:14:02,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-03-16 16:14:02,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:14:02,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:14:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 521157369, now seen corresponding path program 1 times [2025-03-16 16:14:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:14:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521179101] [2025-03-16 16:14:02,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:14:02,998 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-03-16 16:14:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:14:03,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-03-16 16:14:03,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Waiting until timeout for monitored process [2025-03-16 16:14:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:14:03,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:14:03,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:14:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:14:03,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 16:14:03,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:14:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:14:03,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:14:03,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:14:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521179101] [2025-03-16 16:14:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521179101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:14:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:14:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 16:14:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105352255] [2025-03-16 16:14:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:14:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 16:14:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:14:03,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 16:14:03,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 16:14:03,245 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-03-16 16:14:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:14:04,496 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-16 16:14:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 16:14:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-03-16 16:14:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:14:04,497 INFO L225 Difference]: With dead ends: 29 [2025-03-16 16:14:04,497 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 16:14:04,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:14:04,497 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 16:14:04,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 54 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 16:14:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 16:14:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-16 16:14:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 16:14:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-16 16:14:04,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2025-03-16 16:14:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:14:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-16 16:14:04,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-03-16 16:14:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-16 16:14:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 16:14:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:14:04,501 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-03-16 16:14:04,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Forceful destruction successful, exit code 0 [2025-03-16 16:14:04,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-03-16 16:14:04,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:14:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:14:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1408601468, now seen corresponding path program 1 times [2025-03-16 16:14:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:14:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349470168] [2025-03-16 16:14:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:14:04,703 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-03-16 16:14:04,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:14:04,704 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-03-16 16:14:04,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Waiting until timeout for monitored process [2025-03-16 16:14:04,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:14:04,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:14:04,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:14:04,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:14:04,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 16:14:04,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:14:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:14:05,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 16:14:05,260 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:14:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349470168] [2025-03-16 16:14:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349470168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 16:14:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1176140591] [2025-03-16 16:14:05,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:14:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 16:14:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 16:14:05,263 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 16:14:05,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-16 16:14:05,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:14:05,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:14:05,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:14:05,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:14:05,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 16:14:05,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:14:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 16:14:05,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:14:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1176140591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:14:05,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 16:14:05,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-03-16 16:14:05,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067507021] [2025-03-16 16:14:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:14:05,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 16:14:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:14:05,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 16:14:05,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-16 16:14:05,545 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-03-16 16:14:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:14:05,614 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-16 16:14:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 16:14:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 24 [2025-03-16 16:14:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:14:05,615 INFO L225 Difference]: With dead ends: 25 [2025-03-16 16:14:05,615 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 16:14:05,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-16 16:14:05,616 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 16:14:05,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 16:14:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 16:14:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 16:14:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 16:14:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-16 16:14:05,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 24 [2025-03-16 16:14:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:14:05,622 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-16 16:14:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-03-16 16:14:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-16 16:14:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 16:14:05,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:14:05,622 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-03-16 16:14:05,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Ended with exit code 0 [2025-03-16 16:14:05,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-16 16:14:06,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-16 16:14:06,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:14:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:14:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1408661050, now seen corresponding path program 1 times [2025-03-16 16:14:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:14:06,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567641052] [2025-03-16 16:14:06,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:14:06,024 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-03-16 16:14:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:14:06,025 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/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-03-16 16:14:06,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Waiting until timeout for monitored process [2025-03-16 16:14:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:14:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:14:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:14:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:14:06,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:14:06,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:14:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 16:14:06,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:14:06,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:14:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567641052] [2025-03-16 16:14:06,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567641052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:14:06,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:14:06,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:14:06,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092181919] [2025-03-16 16:14:06,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:14:06,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:14:06,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:14:06,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:14:06,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:14:06,103 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-03-16 16:14:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:14:06,111 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-03-16 16:14:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:14:06,112 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-03-16 16:14:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:14:06,112 INFO L225 Difference]: With dead ends: 21 [2025-03-16 16:14:06,112 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 16:14:06,112 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-03-16 16:14:06,112 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:14:06,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:14:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 16:14:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 16:14:06,113 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-03-16 16:14:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 16:14:06,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-03-16 16:14:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:14:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 16:14:06,113 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-03-16 16:14:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 16:14:06,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 16:14:06,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 16:14:06,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Ended with exit code 0 [2025-03-16 16:14:06,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/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-03-16 16:14:06,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:14:06,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 16:14:07,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:14:07,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:14:07 BoogieIcfgContainer [2025-03-16 16:14:07,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:14:07,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:14:07,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:14:07,117 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:14:07,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:44" (3/4) ... [2025-03-16 16:14:07,119 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 16:14:07,122 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2025-03-16 16:14:07,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-16 16:14:07,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-16 16:14:07,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 16:14:07,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 16:14:07,144 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-16 16:14:07,151 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-16 16:14:07,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 16:14:07,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 16:14:07,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:14:07,177 INFO L158 Benchmark]: Toolchain (without parser) took 22803.21ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 22.8MB in the end (delta: 36.5MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.28ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 47.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.33ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 46.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: Boogie Preprocessor took 22.71ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: IcfgBuilder took 289.36ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 30.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:14:07,178 INFO L158 Benchmark]: TraceAbstraction took 22202.83ms. Allocated memory is still 83.9MB. Free memory was 30.3MB in the beginning and 28.7MB in the end (delta: 1.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-03-16 16:14:07,179 INFO L158 Benchmark]: Witness Printer took 59.88ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 22.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:14:07,179 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.28ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 47.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.33ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 46.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.71ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.36ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 30.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22202.83ms. Allocated memory is still 83.9MB. Free memory was 30.3MB in the beginning and 28.7MB in the end (delta: 1.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 59.88ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 22.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. 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: 80]: 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, 35 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 638 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 333 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=9, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 321 ConstructedInterpolants, 54 QuantifiedInterpolants, 1720 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1259 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 61/66 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 - InvariantResult [Line: 31]: Location Invariant Derived location invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-03-16 16:14:07,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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