./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:36:35,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:36:35,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:36:35,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:36:35,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:36:35,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:36:35,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:36:35,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:36:35,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:36:35,090 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:36:35,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:36:35,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:36:35,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:36:35,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:36:35,092 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:36:35,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:36:35,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:36:35,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:36:35,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:36:35,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:36:35,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:36:35,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:36:35,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:36:35,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:36:35,095 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:36:35,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:36:35,095 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:36:35,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:36:35,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:36:35,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:36:35,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:36:35,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:36:35,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:36:35,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:36:35,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:36:35,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:36:35,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:36:35,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:36:35,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:36:35,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:36:35,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:36:35,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:36:35,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:36:35,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:36:35,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:36:35,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:36:35,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:36:35,319 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:36:35,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 23:36:36,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:36:36,625 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:36:36,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 23:36:36,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e98aea0/89cce8de540943c194eaba8f19282721/FLAG2c80face6 [2023-11-22 23:36:36,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e98aea0/89cce8de540943c194eaba8f19282721 [2023-11-22 23:36:36,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:36:36,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:36:36,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:36:36,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:36:36,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:36:36,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ffaa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36, skipping insertion in model container [2023-11-22 23:36:36,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:36:36,807 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 23:36:36,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:36:36,835 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:36:36,845 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 23:36:36,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:36:36,866 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:36:36,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36 WrapperNode [2023-11-22 23:36:36,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:36:36,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:36:36,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:36:36,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:36:36,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,904 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 50 [2023-11-22 23:36:36,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:36:36,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:36:36,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:36:36,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:36:36,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:36:36,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:36:36,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:36:36,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:36:36,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (1/1) ... [2023-11-22 23:36:36,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:36:36,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:36:36,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:36:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:36:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:36:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2023-11-22 23:36:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2023-11-22 23:36:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:36:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:36:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:36:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2023-11-22 23:36:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2023-11-22 23:36:37,050 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:36:37,053 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:36:37,176 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:36:37,194 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:36:37,195 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 23:36:37,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:37 BoogieIcfgContainer [2023-11-22 23:36:37,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:36:37,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:36:37,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:36:37,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:36:37,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:36:36" (1/3) ... [2023-11-22 23:36:37,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e018f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:37, skipping insertion in model container [2023-11-22 23:36:37,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:36" (2/3) ... [2023-11-22 23:36:37,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e018f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:37, skipping insertion in model container [2023-11-22 23:36:37,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:37" (3/3) ... [2023-11-22 23:36:37,201 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2023-11-22 23:36:37,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:36:37,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:36:37,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:36:37,303 INFO L357 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, mHoare=true, 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;@48cb4f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:36:37,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:36:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:36:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:36:37,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:36:37,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:36:37,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:36:37,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:36:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash -943234999, now seen corresponding path program 1 times [2023-11-22 23:36:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:36:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171938638] [2023-11-22 23:36:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:36:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:36:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:36:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 23:36:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:36:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 23:36:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:36:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:36:37,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:36:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171938638] [2023-11-22 23:36:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171938638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:36:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:36:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:36:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981004496] [2023-11-22 23:36:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:36:37,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:36:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:36:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:36:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:36:37,527 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:36:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:36:37,545 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-22 23:36:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:36:37,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-22 23:36:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:36:37,551 INFO L225 Difference]: With dead ends: 46 [2023-11-22 23:36:37,551 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 23:36:37,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:36:37,556 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:36:37,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:36:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 23:36:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-22 23:36:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:36:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-22 23:36:37,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2023-11-22 23:36:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:36:37,579 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-22 23:36:37,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:36:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-22 23:36:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:36:37,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:36:37,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:36:37,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:36:37,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:36:37,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:36:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1964303353, now seen corresponding path program 1 times [2023-11-22 23:36:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:36:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659567205] [2023-11-22 23:36:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:36:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:36:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 23:36:37,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 23:36:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 23:36:37,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 23:36:37,618 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 23:36:37,619 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 23:36:37,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:36:37,623 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-22 23:36:37,625 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 23:36:37,634 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 23:36:37,635 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-22 23:36:37,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:36:37 BoogieIcfgContainer [2023-11-22 23:36:37,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 23:36:37,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 23:36:37,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 23:36:37,641 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 23:36:37,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:37" (3/4) ... [2023-11-22 23:36:37,643 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 23:36:37,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 23:36:37,644 INFO L158 Benchmark]: Toolchain (without parser) took 995.14ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 87.9MB in the beginning and 141.6MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:36:37,644 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:36:37,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 144.7MB. Free memory was 87.6MB in the beginning and 77.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 23:36:37,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 144.7MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:36:37,645 INFO L158 Benchmark]: Boogie Preprocessor took 21.65ms. Allocated memory is still 144.7MB. Free memory was 75.6MB in the beginning and 74.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:36:37,646 INFO L158 Benchmark]: RCFGBuilder took 267.97ms. Allocated memory is still 144.7MB. Free memory was 74.4MB in the beginning and 63.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 23:36:37,646 INFO L158 Benchmark]: TraceAbstraction took 443.80ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 62.2MB in the beginning and 141.6MB in the end (delta: -79.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:36:37,646 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 192.9MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:36:37,648 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 144.7MB. Free memory was 87.6MB in the beginning and 77.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 144.7MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.65ms. Allocated memory is still 144.7MB. Free memory was 75.6MB in the beginning and 74.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.97ms. Allocated memory is still 144.7MB. Free memory was 74.4MB in the beginning and 63.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 443.80ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 62.2MB in the beginning and 141.6MB in the end (delta: -79.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 192.9MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 17]: 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 someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35. Possible FailurePath: [L20] const double Pi=3.141592653589793238; [L47] double a, r; [L49] a = __VERIFIER_nondet_double() [L50] CALL assume_abort_if_not(a >= -1.79e308 && a <= 1.79e308) [L15] COND FALSE !(!cond) VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=1, cond=1] [L50] RET assume_abort_if_not(a >= -1.79e308 && a <= 1.79e308) [L52] CALL, EXPR ARCTAN(a) [L41] COND FALSE !(x < 0) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L42] CALL, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55] [L35] COND TRUE x > 1. VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L35] CALL, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000] [L30] CALL, EXPR PADE_2_2(x) [L24] double x_2 = x*x; [L25] return 1. - x_2 / (3. + 9./5.*x_2); [L30] RET, EXPR PADE_2_2(x) [L30] return x*PADE_2_2(x); [L35] RET, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L35] return Pi / 2. - ARCTAN_0_1(1. / x); [L42] RET, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L42] return ARCTAN_POS(x); [L52] RET, EXPR ARCTAN(a) [L52] r = ARCTAN(a) [L54] CALL __VERIFIER_assert(r >= -1.571 && r <= 1.571) [L17] COND TRUE !(cond) VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=0, cond=0] [L17] reach_error() VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 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, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-22 23:36:37,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:36:39,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:36:39,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 23:36:39,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:36:39,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:36:39,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:36:39,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:36:39,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:36:39,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:36:39,732 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:36:39,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:36:39,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:36:39,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:36:39,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:36:39,735 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:36:39,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:36:39,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:36:39,737 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:36:39,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:36:39,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:36:39,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:36:39,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:36:39,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:36:39,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 23:36:39,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 23:36:39,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 23:36:39,741 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:36:39,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:36:39,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:36:39,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:36:39,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:36:39,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:36:39,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:36:39,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:36:39,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:36:39,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:36:39,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:36:39,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:36:39,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:36:39,745 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 23:36:39,745 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:36:40,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:36:40,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:36:40,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:36:40,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:36:40,048 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:36:40,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 23:36:41,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:36:41,365 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:36:41,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 23:36:41,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42589f458/32b16d8761be44c4b792ef61a330d83c/FLAG73113c8f6 [2023-11-22 23:36:41,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42589f458/32b16d8761be44c4b792ef61a330d83c [2023-11-22 23:36:41,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:36:41,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:36:41,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:36:41,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:36:41,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:36:41,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4adffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41, skipping insertion in model container [2023-11-22 23:36:41,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:36:41,535 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 23:36:41,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:36:41,566 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:36:41,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 23:36:41,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:36:41,606 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:36:41,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41 WrapperNode [2023-11-22 23:36:41,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:36:41,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:36:41,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:36:41,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:36:41,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,650 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 51 [2023-11-22 23:36:41,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:36:41,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:36:41,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:36:41,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:36:41,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:36:41,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:36:41,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:36:41,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:36:41,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (1/1) ... [2023-11-22 23:36:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:36:41,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:36:41,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:36:41,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:36:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:36:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 23:36:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2023-11-22 23:36:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2023-11-22 23:36:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:36:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:36:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2023-11-22 23:36:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2023-11-22 23:36:41,785 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:36:41,787 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:36:45,254 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:36:45,291 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:36:45,292 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 23:36:45,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:45 BoogieIcfgContainer [2023-11-22 23:36:45,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:36:45,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:36:45,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:36:45,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:36:45,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:36:41" (1/3) ... [2023-11-22 23:36:45,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5b0f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:45, skipping insertion in model container [2023-11-22 23:36:45,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:41" (2/3) ... [2023-11-22 23:36:45,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5b0f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:45, skipping insertion in model container [2023-11-22 23:36:45,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:45" (3/3) ... [2023-11-22 23:36:45,304 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2023-11-22 23:36:45,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:36:45,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:36:45,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:36:45,361 INFO L357 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, mHoare=true, 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;@1eaffa2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:36:45,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:36:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:36:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:36:45,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:36:45,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:36:45,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:36:45,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:36:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -943234999, now seen corresponding path program 1 times [2023-11-22 23:36:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:36:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510735761] [2023-11-22 23:36:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:36:45,390 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 [2023-11-22 23:36:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:36:45,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:36:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 23:36:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:36:47,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 23:36:47,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:36:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:36:47,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:36:47,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:36:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510735761] [2023-11-22 23:36:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510735761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:36:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:36:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:36:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080180819] [2023-11-22 23:36:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:36:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:36:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:36:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:36:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:36:47,439 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 23:36:49,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 23:36:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:36:50,093 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-22 23:36:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:36:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-22 23:36:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:36:50,101 INFO L225 Difference]: With dead ends: 46 [2023-11-22 23:36:50,101 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 23:36:50,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:36:50,105 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-22 23:36:50,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-11-22 23:36:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 23:36:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-22 23:36:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:36:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-22 23:36:50,141 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2023-11-22 23:36:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:36:50,141 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-22 23:36:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 23:36:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-22 23:36:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:36:50,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:36:50,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:36:50,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 23:36:50,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:36:50,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:36:50,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:36:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 642770955, now seen corresponding path program 1 times [2023-11-22 23:36:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:36:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884193003] [2023-11-22 23:36:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:36:50,378 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 [2023-11-22 23:36:50,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:36:50,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:36:50,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 23:37:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:37:10,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 23:37:10,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:37:27,308 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= |c_ARCTAN_0_1_#res#1| (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_#in~x#1|))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:37:37,206 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:37:39,705 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ARCTAN_POS_#t~ret5| (let ((.cse0 (fp.div c_currentRoundingMode .cse1 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 (let ((.cse2 (fp.mul c_currentRoundingMode .cse0 .cse0))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2)))))))) (fp.gt ARCTAN_POS_~x .cse1)))) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:37:49,857 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:37:52,433 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ARCTAN_POS_#res| (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 (let ((.cse2 (fp.mul c_currentRoundingMode .cse0 .cse0))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2))))))))) (fp.gt ARCTAN_POS_~x .cse1)))) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:38:02,688 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:38:12,940 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:38:15,348 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 (let ((.cse2 (fp.mul c_currentRoundingMode .cse0 .cse0))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2)))))))) |c_ULTIMATE.start_ARCTAN_#t~ret7#1|) (fp.gt ARCTAN_POS_~x .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:38:25,572 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:38:28,053 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt ARCTAN_POS_~x .cse0) (= (fp.neg (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse0 (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 .cse1))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2))))))))) |c_ULTIMATE.start_ARCTAN_#res#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:38:30,248 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt ARCTAN_POS_~x .cse0) (= (fp.neg (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse0 (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 .cse1))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2))))))))) |c_ULTIMATE.start_ARCTAN_#res#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-22 23:38:45,319 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:38:57,830 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:05,576 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:11,033 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:16,470 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:19,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1571.0 1000.0)))) (let ((.cse6 (fp.neg .cse9)) (.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse5 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse3))))))))) .cse6)) (fp.gt ARCTAN_POS_~x .cse2))) (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse7 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 .cse7))) (fp.div roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse8))))))))) .cse9)) (fp.gt ARCTAN_POS_~x .cse2))))) (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse10 (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse11 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse11 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 .cse11))) (fp.div roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse12))))))))))) (and (fp.geq .cse10 .cse6) (fp.leq .cse10 .cse9) (fp.gt ARCTAN_POS_~x .cse2)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2023-11-22 23:39:32,612 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:45,251 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:39:48,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse5 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1571.0 1000.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse3))))))))) (fp.neg .cse6))) (fp.gt ARCTAN_POS_~x .cse2))) (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse7 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 .cse7))) (fp.div roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse8))))))))) .cse6)) (fp.gt ARCTAN_POS_~x .cse2))))) is different from false [2023-11-22 23:39:50,198 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse5 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1571.0 1000.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse3))))))))) (fp.neg .cse6))) (fp.gt ARCTAN_POS_~x .cse2))) (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.neg (fp.sub roundNearestTiesToEven .cse0 (let ((.cse7 (fp.div roundNearestTiesToEven .cse2 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 .cse7))) (fp.div roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse5 .cse8))))))))) .cse6)) (fp.gt ARCTAN_POS_~x .cse2))))) is different from true [2023-11-22 23:39:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:39:50,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:39:50,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:39:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884193003] [2023-11-22 23:39:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884193003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 23:39:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631762002] [2023-11-22 23:39:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 23:39:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:39:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 23:39:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=11, Unknown=9, NotChecked=70, Total=110 [2023-11-22 23:39:50,202 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:39:53,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 23:39:56,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 23:39:58,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 23:40:01,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)))) (and (= c_~Pi~0 .cse0) (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 ARCTAN_POS_~x))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 .cse1))) (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse3)))))))) |c_ULTIMATE.start_ARCTAN_#t~ret7#1|) (fp.gt ARCTAN_POS_~x .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-22 23:40:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:01,457 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-22 23:40:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 23:40:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-22 23:40:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:01,463 INFO L225 Difference]: With dead ends: 29 [2023-11-22 23:40:01,464 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 23:40:01,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=22, Invalid=12, Unknown=10, NotChecked=88, Total=132 [2023-11-22 23:40:01,465 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:01,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 220 Unchecked, 8.7s Time] [2023-11-22 23:40:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 23:40:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 23:40:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-22 23:40:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-22 23:40:01,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2023-11-22 23:40:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:01,472 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-22 23:40:01,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:40:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-22 23:40:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 23:40:01,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:01,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:40:01,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-22 23:40:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:01,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:01,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1964303353, now seen corresponding path program 1 times [2023-11-22 23:40:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:40:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843015389] [2023-11-22 23:40:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:01,675 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 [2023-11-22 23:40:01,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:40:01,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:40:01,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 23:40:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:18,942 WARN L260 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 23:40:18,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:59,057 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg .cse0)) (fp.leq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| .cse0)))) (= |c_ARCTAN_0_1_#res#1| (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_#in~x#1|))) (fp.div c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse1))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 23:41:05,135 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:41:10,532 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:41:15,827 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 23:41:21,117 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15