./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/digits_for.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/digits_for.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:59:51,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:59:51,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:59:51,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:59:51,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:59:52,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:59:52,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:59:52,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:59:52,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:59:52,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:59:52,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:59:52,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:59:52,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:59:52,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:59:52,012 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:59:52,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:59:52,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:59:52,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:59:52,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:59:52,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:59:52,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:59:52,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:52,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:52,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:59:52,015 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d [2025-01-09 00:59:52,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:59:52,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:59:52,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:59:52,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:59:52,242 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:59:52,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2025-01-09 00:59:53,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aba5e15af/784aea079a544456a958122342e26f0f/FLAG375c976be [2025-01-09 00:59:53,697 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:59:53,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2025-01-09 00:59:53,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aba5e15af/784aea079a544456a958122342e26f0f/FLAG375c976be [2025-01-09 00:59:53,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aba5e15af/784aea079a544456a958122342e26f0f [2025-01-09 00:59:53,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:59:53,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:59:53,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:59:53,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:59:53,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:59:53,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53, skipping insertion in model container [2025-01-09 00:59:53,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:59:53,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2025-01-09 00:59:53,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:59:53,874 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:59:53,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2025-01-09 00:59:53,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:59:53,897 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:59:53,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53 WrapperNode [2025-01-09 00:59:53,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:59:53,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:59:53,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:59:53,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:59:53,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,918 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2025-01-09 00:59:53,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:59:53,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:59:53,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:59:53,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:59:53,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,933 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:59:53,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:59:53,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:59:53,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:59:53,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:59:53,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (1/1) ... [2025-01-09 00:59:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:59:53,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:59:53,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:59:53,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:59:54,032 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:59:54,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:59:54,092 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-09 00:59:54,092 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:59:54,104 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:59:54,104 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:59:54,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:54 BoogieIcfgContainer [2025-01-09 00:59:54,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:59:54,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:59:54,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:59:54,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:59:54,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:59:53" (1/3) ... [2025-01-09 00:59:54,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38197243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:54, skipping insertion in model container [2025-01-09 00:59:54,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:53" (2/3) ... [2025-01-09 00:59:54,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38197243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:54, skipping insertion in model container [2025-01-09 00:59:54,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:54" (3/3) ... [2025-01-09 00:59:54,111 INFO L128 eAbstractionObserver]: Analyzing ICFG digits_for.c [2025-01-09 00:59:54,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:59:54,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG digits_for.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:59:54,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:59:54,155 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;@32ddda00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:59:54,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:59:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-01-09 00:59:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 00:59:54,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:59:54,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 00:59:54,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:59:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:59:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash 28696775, now seen corresponding path program 1 times [2025-01-09 00:59:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:59:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130296725] [2025-01-09 00:59:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:59:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:59:54,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 00:59:54,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 00:59:54,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:59:54,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:59:54,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:59:54,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 00:59:54,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 00:59:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:59:54,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:59:54,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:59:54,243 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:59:54,244 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:59:54,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:59:54,250 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 00:59:54,262 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:59:54,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:59:54 BoogieIcfgContainer [2025-01-09 00:59:54,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:59:54,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:59:54,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:59:54,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:59:54,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:54" (3/4) ... [2025-01-09 00:59:54,271 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:59:54,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:59:54,273 INFO L158 Benchmark]: Toolchain (without parser) took 532.08ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 87.6MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 00:59:54,273 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:59:54,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.83ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:59:54,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.55ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:59:54,273 INFO L158 Benchmark]: Boogie Preprocessor took 27.04ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:59:54,274 INFO L158 Benchmark]: RCFGBuilder took 157.27ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 99.7MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:59:54,274 INFO L158 Benchmark]: TraceAbstraction took 160.62ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 87.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:59:54,274 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 167.8MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:59:54,275 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.19ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.83ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.55ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.04ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 157.27ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 99.7MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 160.62ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 87.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 167.8MB. Free memory is still 87.6MB. 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: 4]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 8, overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 11. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L11] COND FALSE !(x != 0) [L17] CALL __VERIFIER_assert(res == 67050) [L4] COND TRUE !(cond) [L4] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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-01-09 00:59:54,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/digits_for.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:59:56,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:59:56,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 00:59:56,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:59:56,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:59:56,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:59:56,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:59:56,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:59:56,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:59:56,270 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:59:56,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:59:56,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:59:56,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:59:56,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:59:56,271 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:59:56,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:59:56,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:59:56,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:59:56,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:56,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:59:56,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:56,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:59:56,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:59:56,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d [2025-01-09 00:59:56,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:59:56,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:59:56,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:59:56,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:59:56,539 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:59:56,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2025-01-09 00:59:57,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34e36ef8b/4bf2d35a35ef4d1e844ef51a4d103ba5/FLAGf172dc7ff [2025-01-09 00:59:57,983 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:59:57,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2025-01-09 00:59:57,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34e36ef8b/4bf2d35a35ef4d1e844ef51a4d103ba5/FLAGf172dc7ff [2025-01-09 00:59:58,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34e36ef8b/4bf2d35a35ef4d1e844ef51a4d103ba5 [2025-01-09 00:59:58,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:59:58,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:59:58,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:59:58,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:59:58,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:59:58,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212d92d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58, skipping insertion in model container [2025-01-09 00:59:58,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:59:58,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2025-01-09 00:59:58,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:59:58,133 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:59:58,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2025-01-09 00:59:58,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:59:58,158 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:59:58,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58 WrapperNode [2025-01-09 00:59:58,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:59:58,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:59:58,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:59:58,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:59:58,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,183 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2025-01-09 00:59:58,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:59:58,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:59:58,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:59:58,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:59:58,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:59:58,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:59:58,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:59:58,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:59:58,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:59:58,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (1/1) ... [2025-01-09 00:59:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:59:58,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:59:58,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:59:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:59:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:59:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:59:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:59:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:59:58,307 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:59:58,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 01:00:02,461 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 01:00:02,461 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 01:00:02,468 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 01:00:02,469 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 01:00:02,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:02 BoogieIcfgContainer [2025-01-09 01:00:02,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 01:00:02,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 01:00:02,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 01:00:02,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 01:00:02,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:59:58" (1/3) ... [2025-01-09 01:00:02,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:02, skipping insertion in model container [2025-01-09 01:00:02,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:58" (2/3) ... [2025-01-09 01:00:02,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:02, skipping insertion in model container [2025-01-09 01:00:02,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:02" (3/3) ... [2025-01-09 01:00:02,481 INFO L128 eAbstractionObserver]: Analyzing ICFG digits_for.c [2025-01-09 01:00:02,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 01:00:02,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG digits_for.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 01:00:02,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 01:00:02,535 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;@39c5c079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 01:00:02,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 01:00:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-01-09 01:00:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 01:00:02,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:00:02,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 01:00:02,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:00:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:00:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 28696775, now seen corresponding path program 1 times [2025-01-09 01:00:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:00:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102604486] [2025-01-09 01:00:02,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:00:02,552 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-01-09 01:00:02,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:00:02,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:00:02,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 01:00:02,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 01:00:02,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 01:00:02,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:00:02,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:00:02,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 01:00:02,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:00:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:00:02,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:00:02,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:00:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102604486] [2025-01-09 01:00:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102604486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:00:02,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:00:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 01:00:02,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780822268] [2025-01-09 01:00:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:00:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 01:00:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:00:02,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 01:00:02,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 01:00:02,733 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 01:00:05,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:00:05,908 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-01-09 01:00:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 01:00:05,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-01-09 01:00:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:00:05,918 INFO L225 Difference]: With dead ends: 18 [2025-01-09 01:00:05,920 INFO L226 Difference]: Without dead ends: 7 [2025-01-09 01:00:05,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 01:00:05,924 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:00:05,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 01:00:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-01-09 01:00:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-01-09 01:00:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-01-09 01:00:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-01-09 01:00:05,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-01-09 01:00:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:00:05,945 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-01-09 01:00:05,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 01:00:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-01-09 01:00:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 01:00:05,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:00:05,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 01:00:05,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 01:00:06,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:00:06,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:00:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:00:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 889537511, now seen corresponding path program 1 times [2025-01-09 01:00:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:00:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276396776] [2025-01-09 01:00:06,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:00:06,148 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-01-09 01:00:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:00:06,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:00:06,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 01:00:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 01:00:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 01:00:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:00:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:00:06,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 01:00:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:00:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:00:08,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:00:17,374 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2025-01-09 01:00:21,412 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2025-01-09 01:00:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 01:00:21,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:00:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276396776] [2025-01-09 01:00:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276396776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:00:21,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:00:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-09 01:00:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084836391] [2025-01-09 01:00:21,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:00:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 01:00:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:00:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 01:00:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42 [2025-01-09 01:00:21,545 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-01-09 01:00:22,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:26,940 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-01-09 01:00:29,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:33,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:36,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:40,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:00:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:00:40,277 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2025-01-09 01:00:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 01:00:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) Word has length 6 [2025-01-09 01:00:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:00:40,279 INFO L225 Difference]: With dead ends: 11 [2025-01-09 01:00:40,279 INFO L226 Difference]: Without dead ends: 8 [2025-01-09 01:00:40,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=17, Invalid=18, Unknown=3, NotChecked=18, Total=56 [2025-01-09 01:00:40,281 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-01-09 01:00:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 10 Unchecked, 14.6s Time] [2025-01-09 01:00:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-01-09 01:00:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-09 01:00:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-01-09 01:00:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-01-09 01:00:40,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2025-01-09 01:00:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:00:40,285 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-01-09 01:00:40,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-01-09 01:00:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-01-09 01:00:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 01:00:40,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:00:40,285 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 01:00:40,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 01:00:40,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:00:40,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:00:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:00:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1805796551, now seen corresponding path program 2 times [2025-01-09 01:00:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:00:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314797294] [2025-01-09 01:00:40,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 01:00:40,488 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-01-09 01:00:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:00:40,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:00:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 01:00:40,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-09 01:00:41,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 01:00:41,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 01:00:41,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:00:41,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 01:00:41,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:00:50,784 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 01:00:54,819 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-01-09 01:00:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 01:00:54,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:01:03,065 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 01:01:07,107 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2025-01-09 01:01:11,148 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2025-01-09 01:01:19,345 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 01:01:23,435 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2025-01-09 01:01:27,540 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2025-01-09 01:01:33,431 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 24 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 01:01:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-09 01:01:33,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:01:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314797294] [2025-01-09 01:01:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314797294] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:01:33,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:01:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-09 01:01:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9328965] [2025-01-09 01:01:33,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:01:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 01:01:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:01:33,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 01:01:33,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=18, Unknown=5, NotChecked=30, Total=72 [2025-01-09 01:01:33,432 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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-01-09 01:01:34,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 01:01:38,907 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-01-09 01:01:42,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false