./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.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/float-benchs/sqrt_Newton_pseudoconstant.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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:57:02,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:57:02,696 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:57:02,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:57:02,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:57:02,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:57:02,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:57:02,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:57:02,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:57:02,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:57:02,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:57:02,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:57:02,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:57:02,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:57:02,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:57:02,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:02,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:02,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:02,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:57:02,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:57:02,727 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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2025-01-09 00:57:03,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:57:03,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:57:03,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:57:03,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:57:03,035 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:57:03,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:04,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77cb4a0b/79209ab41776445582636a1a56b222f1/FLAGad857b5f8 [2025-01-09 00:57:04,672 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:57:04,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:04,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77cb4a0b/79209ab41776445582636a1a56b222f1/FLAGad857b5f8 [2025-01-09 00:57:04,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c77cb4a0b/79209ab41776445582636a1a56b222f1 [2025-01-09 00:57:04,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:57:04,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:57:04,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:04,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:57:04,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:57:04,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:04" (1/1) ... [2025-01-09 00:57:04,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc11076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:04, skipping insertion in model container [2025-01-09 00:57:04,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:04" (1/1) ... [2025-01-09 00:57:05,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:57:05,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2025-01-09 00:57:05,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:05,163 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:57:05,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2025-01-09 00:57:05,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:05,201 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:57:05,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05 WrapperNode [2025-01-09 00:57:05,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:05,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:05,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:57:05,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:57:05,210 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:57:05" (1/1) ... [2025-01-09 00:57:05,216 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:57:05" (1/1) ... [2025-01-09 00:57:05,235 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-01-09 00:57:05,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:05,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:57:05,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:57:05,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:57:05,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,264 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:57:05,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:57:05,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:57:05,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:57:05,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:57:05,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (1/1) ... [2025-01-09 00:57:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:57:05,319 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:57:05,322 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:57:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:57:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:57:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:57:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:57:05,394 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:57:05,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:57:05,497 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 00:57:05,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:57:05,504 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:57:05,505 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:57:05,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:05 BoogieIcfgContainer [2025-01-09 00:57:05,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:57:05,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:57:05,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:57:05,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:57:05,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:57:04" (1/3) ... [2025-01-09 00:57:05,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a3f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:05, skipping insertion in model container [2025-01-09 00:57:05,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:05" (2/3) ... [2025-01-09 00:57:05,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a3f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:05, skipping insertion in model container [2025-01-09 00:57:05,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:05" (3/3) ... [2025-01-09 00:57:05,514 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:05,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:57:05,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Newton_pseudoconstant.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 00:57:05,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:57:05,593 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;@6ea69ad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:57:05,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:57:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:57:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:05,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:05,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:05,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash -588360081, now seen corresponding path program 1 times [2025-01-09 00:57:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:57:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117122979] [2025-01-09 00:57:05,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:05,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:57:05,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:05,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:57:05,746 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 00:57:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:57:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117122979] [2025-01-09 00:57:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117122979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:57:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:57:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:57:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326433399] [2025-01-09 00:57:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:57:05,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:57:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:57:05,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:57:05,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:57:05,766 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:57:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:57:05,775 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-01-09 00:57:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:57:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 00:57:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:57:05,781 INFO L225 Difference]: With dead ends: 30 [2025-01-09 00:57:05,781 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 00:57:05,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-09 00:57:05,786 INFO L435 NwaCegarLoop]: 18 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, 18 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-01-09 00:57:05,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:57:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 00:57:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 00:57:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:57:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-09 00:57:05,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-01-09 00:57:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:57:05,808 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-09 00:57:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:57:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-01-09 00:57:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:05,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:05,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:05,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:57:05,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1397706707, now seen corresponding path program 1 times [2025-01-09 00:57:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:57:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492541260] [2025-01-09 00:57:05,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:57:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:05,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:05,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:05,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:57:05,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:57:05,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:05,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:05,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:05,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:57:05,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:57:05,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:57:05,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:57:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:57:05,887 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 00:57:05,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:57:05,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:57:05 BoogieIcfgContainer [2025-01-09 00:57:05,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:57:05,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:57:05,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:57:05,906 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:57:05,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:05" (3/4) ... [2025-01-09 00:57:05,908 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:57:05,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:57:05,910 INFO L158 Benchmark]: Toolchain (without parser) took 932.06ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 60.2MB in the end (delta: 45.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:57:05,910 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:57:05,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.38ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:57:05,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:57:05,911 INFO L158 Benchmark]: Boogie Preprocessor took 45.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.9MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:57:05,911 INFO L158 Benchmark]: RCFGBuilder took 223.00ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 80.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:57:05,911 INFO L158 Benchmark]: TraceAbstraction took 397.41ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 60.6MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:57:05,912 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 142.6MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:57:05,913 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 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.38ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.9MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 223.00ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 80.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 397.41ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 60.6MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 142.6MB. Free memory is still 60.2MB. 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: 13]: 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 37, overapproximation of someBinaryArithmeticDOUBLEoperation at line 23, overapproximation of someUnaryDOUBLEoperation at line 25, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 21, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 26. Possible FailurePath: [L15] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. VAL [_EPS=1/1000000] [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L48] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L50] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; VAL [_EPS=1/1000000] [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 VAL [_EPS=1/1000000, xn=1] [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [_EPS=1/1000000, cond=0, i=0] [L28] COND FALSE !(\read(cond)) [L37] return 1.0 / xnp1; VAL [_EPS=1/1000000, i=0] [L50] RET, EXPR SqrtR(dd) [L50] r = SqrtR(dd) [L52] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) VAL [_EPS=1/1000000] [L13] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:57:05,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:57:08,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:57:08,294 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:57:08,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:57:08,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:57:08,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:57:08,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:57:08,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:57:08,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:57:08,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:57:08,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:57:08,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:57:08,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:57:08,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:57:08,335 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:57:08,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:57:08,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:57:08,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:57:08,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:08,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:08,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:08,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:57:08,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:57:08,339 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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2025-01-09 00:57:08,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:57:08,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:57:08,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:57:08,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:57:08,653 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:57:08,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:09,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423954eb2/31ceff0e213c4972bdbd9d4a43d10b95/FLAGef5b5afa4 [2025-01-09 00:57:10,153 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:57:10,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:10,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423954eb2/31ceff0e213c4972bdbd9d4a43d10b95/FLAGef5b5afa4 [2025-01-09 00:57:10,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423954eb2/31ceff0e213c4972bdbd9d4a43d10b95 [2025-01-09 00:57:10,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:57:10,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:57:10,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:10,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:57:10,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:57:10,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508fff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10, skipping insertion in model container [2025-01-09 00:57:10,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:57:10,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2025-01-09 00:57:10,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:10,393 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:57:10,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2025-01-09 00:57:10,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:10,432 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:57:10,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10 WrapperNode [2025-01-09 00:57:10,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:10,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:10,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:57:10,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:57:10,443 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:57:10" (1/1) ... [2025-01-09 00:57:10,454 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:57:10" (1/1) ... [2025-01-09 00:57:10,473 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2025-01-09 00:57:10,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:10,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:57:10,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:57:10,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:57:10,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,504 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:57:10,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:57:10,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:57:10,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:57:10,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:57:10,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (1/1) ... [2025-01-09 00:57:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:57:10,546 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:57:10,549 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:57:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:57:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:57:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:57:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:57:10,618 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:57:10,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:57:26,164 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 00:57:26,164 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:57:26,171 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:57:26,171 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:57:26,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:26 BoogieIcfgContainer [2025-01-09 00:57:26,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:57:26,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:57:26,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:57:26,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:57:26,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:57:10" (1/3) ... [2025-01-09 00:57:26,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72e6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:26, skipping insertion in model container [2025-01-09 00:57:26,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:10" (2/3) ... [2025-01-09 00:57:26,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72e6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:26, skipping insertion in model container [2025-01-09 00:57:26,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:26" (3/3) ... [2025-01-09 00:57:26,182 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2025-01-09 00:57:26,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:57:26,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Newton_pseudoconstant.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 00:57:26,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:57:26,243 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;@ab4226b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:57:26,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:57:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:57:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:26,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:26,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:26,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:26,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash -588360081, now seen corresponding path program 1 times [2025-01-09 00:57:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:57:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411707670] [2025-01-09 00:57:26,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:26,263 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 00:57:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:57:26,270 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 00:57:26,271 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 00:57:26,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:27,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:57:27,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 00:57:27,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:57:27,507 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 00:57:27,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:57:27,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:57:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411707670] [2025-01-09 00:57:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411707670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:57:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:57:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:57:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003895743] [2025-01-09 00:57:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:57:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:57:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:57:27,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:57:27,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:57:27,528 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:57:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:57:27,538 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-01-09 00:57:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:57:27,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 00:57:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:57:27,546 INFO L225 Difference]: With dead ends: 30 [2025-01-09 00:57:27,546 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 00:57:27,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-01-09 00:57:27,551 INFO L435 NwaCegarLoop]: 18 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, 18 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-01-09 00:57:27,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:57:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 00:57:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 00:57:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:57:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-09 00:57:27,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-01-09 00:57:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:57:27,571 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-09 00:57:27,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:57:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-01-09 00:57:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:27,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:27,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:27,601 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 00:57:27,772 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 00:57:27,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1397706707, now seen corresponding path program 1 times [2025-01-09 00:57:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:57:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769600967] [2025-01-09 00:57:27,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:27,774 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 00:57:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:57:27,776 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 00:57:27,777 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 00:57:27,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:28,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:28,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:28,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:57:28,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 00:57:28,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:57:29,985 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 00:57:29,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:57:29,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:57:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769600967] [2025-01-09 00:57:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769600967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:57:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:57:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:57:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399802035] [2025-01-09 00:57:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:57:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:57:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:57:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:57:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:57:29,988 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:57:32,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:36,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:40,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:44,946 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 00:57:48,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:53,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:57,426 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 00:58:01,434 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 00:58:05,446 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 00:58:09,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:58:13,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:58:14,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:58:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:58:14,999 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-01-09 00:58:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:58:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) Word has length 11 [2025-01-09 00:58:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:58:15,007 INFO L225 Difference]: With dead ends: 26 [2025-01-09 00:58:15,007 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 00:58:15,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:58:15,007 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:58:15,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 44.8s Time] [2025-01-09 00:58:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 00:58:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 00:58:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:58:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-01-09 00:58:15,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2025-01-09 00:58:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:58:15,011 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-09 00:58:15,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:58:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-01-09 00:58:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:58:15,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:58:15,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:58:15,045 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 00:58:15,212 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 00:58:15,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:58:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:58:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1340448405, now seen corresponding path program 1 times [2025-01-09 00:58:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:58:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874209095] [2025-01-09 00:58:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:58:15,214 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 00:58:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:58:15,215 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 00:58:15,216 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 00:58:15,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:58:17,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:58:17,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:58:17,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:58:17,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 00:58:17,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:58:25,838 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 00:58:40,762 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)