./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/arctan_Pade.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/arctan_Pade.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd --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 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:17:51,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:17:52,035 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:17:52,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:17:52,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:17:52,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:17:52,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:17:52,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:17:52,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:17:52,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:17:52,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:17:52,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:17:52,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:17:52,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:17:52,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:17:52,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:17:52,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:17:52,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:17:52,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:17:52,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:17:52,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:17:52,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:17:52,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:17:52,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:17:52,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:17:52,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:17:52,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:17:52,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:52,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:17:52,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:17:52,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:17:52,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:17:52,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd 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 [2024-11-13 13:17:52,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:17:52,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:17:52,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:17:52,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:17:52,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:17:52,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/arctan_Pade.c Unable to find full path for "g++" [2024-11-13 13:17:54,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:17:54,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:17:54,806 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c [2024-11-13 13:17:54,814 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/ee16c8ff2/e5769a0f197c4eccb85cf0dbd8280b08/FLAG72b5e7b70 [2024-11-13 13:17:54,829 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/ee16c8ff2/e5769a0f197c4eccb85cf0dbd8280b08 [2024-11-13 13:17:54,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:17:54,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:17:54,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:17:54,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:17:54,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:17:54,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:54" (1/1) ... [2024-11-13 13:17:54,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9c3334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:54, skipping insertion in model container [2024-11-13 13:17:54,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:54" (1/1) ... [2024-11-13 13:17:54,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:17:55,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c[665,678] [2024-11-13 13:17:55,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:17:55,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:17:55,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c[665,678] [2024-11-13 13:17:55,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:17:55,087 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:17:55,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55 WrapperNode [2024-11-13 13:17:55,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:17:55,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:17:55,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:17:55,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:17:55,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,132 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 51 [2024-11-13 13:17:55,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:17:55,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:17:55,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:17:55,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:17:55,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:17:55,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:17:55,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:17:55,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:17:55,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:17:55,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (1/1) ... [2024-11-13 13:17:55,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:55,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:17:55,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:17:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:17:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2024-11-13 13:17:55,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2024-11-13 13:17:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:17:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:17:55,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:17:55,248 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2024-11-13 13:17:55,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2024-11-13 13:17:55,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:17:55,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:17:55,492 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 13:17:55,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:17:55,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:17:55,505 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:17:55,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:17:55 BoogieIcfgContainer [2024-11-13 13:17:55,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:17:55,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:17:55,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:17:55,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:17:55,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:17:54" (1/3) ... [2024-11-13 13:17:55,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b176d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:17:55, skipping insertion in model container [2024-11-13 13:17:55,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:55" (2/3) ... [2024-11-13 13:17:55,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b176d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:17:55, skipping insertion in model container [2024-11-13 13:17:55,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:17:55" (3/3) ... [2024-11-13 13:17:55,519 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2024-11-13 13:17:55,537 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:17:55,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG arctan_Pade.c that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 13:17:55,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:17:55,614 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3596d1b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:17:55,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:17:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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) [2024-11-13 13:17:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:17:55,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:55,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:55,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:17:55,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2095581372, now seen corresponding path program 1 times [2024-11-13 13:17:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966249710] [2024-11-13 13:17:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:17:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:17:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:55,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966249710] [2024-11-13 13:17:55,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966249710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:55,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:17:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449457548] [2024-11-13 13:17:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:17:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:17:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:17:55,890 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-13 13:17:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:55,909 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-11-13 13:17:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:17:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 20 [2024-11-13 13:17:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:55,918 INFO L225 Difference]: With dead ends: 55 [2024-11-13 13:17:55,918 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 13:17:55,922 INFO L431 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 [2024-11-13 13:17:55,927 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:55,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:17:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 13:17:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 13:17:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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) [2024-11-13 13:17:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-13 13:17:55,968 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2024-11-13 13:17:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:55,968 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-13 13:17:55,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-13 13:17:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-13 13:17:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:17:55,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:55,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:55,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:17:55,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:17:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash 205241218, now seen corresponding path program 1 times [2024-11-13 13:17:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:55,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611967110] [2024-11-13 13:17:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:17:56,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:17:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:17:56,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:17:56,068 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:17:56,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:17:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:17:56,075 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 13:17:56,094 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:17:56,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:17:56 BoogieIcfgContainer [2024-11-13 13:17:56,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:17:56,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:17:56,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:17:56,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:17:56,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:17:55" (3/4) ... [2024-11-13 13:17:56,102 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:17:56,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:17:56,103 INFO L158 Benchmark]: Toolchain (without parser) took 1270.93ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 45.5MB in the end (delta: 47.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-13 13:17:56,104 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:56,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.32ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 82.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:17:56,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.25ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:56,105 INFO L158 Benchmark]: Boogie Preprocessor took 47.69ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:17:56,105 INFO L158 Benchmark]: RCFGBuilder took 323.37ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:17:56,106 INFO L158 Benchmark]: TraceAbstraction took 588.96ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 45.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:17:56,106 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 185.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:56,108 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.50ms. Allocated memory is still 117.4MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.32ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 82.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.25ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.69ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 323.37ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 588.96ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 45.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 185.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryArithmeticDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 50. Possible FailurePath: [L20] const double Pi=3.141592653589793238; VAL [Pi=1570796326794896619/500000000000000000] [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] [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, x=54] [L42] CALL, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=54] [L35] COND TRUE x > 1. VAL [Pi=1570796326794896619/500000000000000000, \old(x)=54, x=54] [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); VAL [Pi=1570796326794896619/500000000000000000] [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)=54, x=54] [L35] return Pi / 2. - ARCTAN_0_1(1. / x); [L42] RET, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, x=54] [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] [L17] reach_error() VAL [Pi=1570796326794896619/500000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 0 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=29occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 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 [2024-11-13 13:17:56,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/arctan_Pade.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd --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 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:17:58,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:17:58,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:17:58,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:17:58,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:17:58,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:17:58,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:17:58,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:17:58,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:17:58,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:17:58,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:17:58,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:17:58,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:17:58,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:17:58,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:17:58,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:17:58,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:17:58,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:17:58,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:17:58,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:58,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:17:58,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:17:58,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:17:58,941 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd 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 [2024-11-13 13:17:59,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:17:59,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:17:59,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:17:59,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:17:59,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:17:59,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/arctan_Pade.c Unable to find full path for "g++" [2024-11-13 13:18:01,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:18:01,565 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:18:01,566 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c [2024-11-13 13:18:01,588 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/40640589a/405e2c7dfd6e4a879bc1e45fd1141967/FLAG13f8c296e [2024-11-13 13:18:01,613 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/data/40640589a/405e2c7dfd6e4a879bc1e45fd1141967 [2024-11-13 13:18:01,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:18:01,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:18:01,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:01,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:18:01,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:18:01,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cdbee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01, skipping insertion in model container [2024-11-13 13:18:01,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:18:01,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c[665,678] [2024-11-13 13:18:01,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:01,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:18:01,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/sv-benchmarks/c/float-benchs/arctan_Pade.c[665,678] [2024-11-13 13:18:01,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:01,907 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:18:01,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01 WrapperNode [2024-11-13 13:18:01,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:01,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:01,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:18:01,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:18:01,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,958 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 52 [2024-11-13 13:18:01,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:01,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:18:01,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:18:01,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:18:01,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:18:01,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:01,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:18:02,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:18:02,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:18:02,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:18:02,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:02,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:18:02,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:18:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:18:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:18:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2024-11-13 13:18:02,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2024-11-13 13:18:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:18:02,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:18:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2024-11-13 13:18:02,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2024-11-13 13:18:02,142 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:18:02,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:18:09,926 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 13:18:09,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:18:09,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:18:09,943 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:18:09,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:09 BoogieIcfgContainer [2024-11-13 13:18:09,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:18:09,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:18:09,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:18:09,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:18:09,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:18:01" (1/3) ... [2024-11-13 13:18:09,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad56941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:09, skipping insertion in model container [2024-11-13 13:18:09,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (2/3) ... [2024-11-13 13:18:09,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad56941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:09, skipping insertion in model container [2024-11-13 13:18:09,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:09" (3/3) ... [2024-11-13 13:18:09,960 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2024-11-13 13:18:09,977 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:18:09,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG arctan_Pade.c that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 13:18:10,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:18:10,085 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79db3eff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:18:10,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:18:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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) [2024-11-13 13:18:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:18:10,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:10,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:10,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2095581372, now seen corresponding path program 1 times [2024-11-13 13:18:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:18:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015672235] [2024-11-13 13:18:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:10,128 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 [2024-11-13 13:18:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:18:10,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:18:10,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:18:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:13,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:18:13,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:18:13,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:13,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:18:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015672235] [2024-11-13 13:18:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015672235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:13,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:18:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181475579] [2024-11-13 13:18:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:13,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:18:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:18:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:18:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:18:13,155 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:18:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:13,176 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-11-13 13:18:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:18:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-13 13:18:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:13,186 INFO L225 Difference]: With dead ends: 55 [2024-11-13 13:18:13,187 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 13:18:13,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:18:13,194 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:13,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:18:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 13:18:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 13:18:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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) [2024-11-13 13:18:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-13 13:18:13,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2024-11-13 13:18:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-13 13:18:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:18:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-13 13:18:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:18:13,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:13,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:13,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:18:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:18:13,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:13,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 205241218, now seen corresponding path program 1 times [2024-11-13 13:18:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:18:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234725949] [2024-11-13 13:18:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:13,443 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 [2024-11-13 13:18:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:18:13,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:18:13,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:20:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:53,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 13:20:53,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:04,148 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:12,658 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:20,971 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:25,134 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_~x#1| |c_ARCTAN_0_1_~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_ARCTAN_0_1_PADE_2_2_#res#1|) (= |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_~x#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:21:33,820 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:42,149 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:50,759 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:21:54,914 WARN L851 $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 [2024-11-13 13:21:59,031 WARN L873 $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 true [2024-11-13 13:22:07,564 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:22:15,860 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:22:24,360 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:22:33,050 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:22:42,073 WARN L286 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:22:46,471 WARN L851 $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 [2024-11-13 13:22:55,124 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:03,929 WARN L286 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:08,384 WARN L851 $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 [2024-11-13 13:23:17,167 WARN L286 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:26,044 WARN L286 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:34,871 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:44,054 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:23:48,473 WARN L851 $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~ret8#1|) (fp.gt ARCTAN_POS_~x .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:23:57,413 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:24:06,690 WARN L286 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:24:11,107 WARN L851 $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) (= |c_ULTIMATE.start_ARCTAN_#res#1| (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_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:24:24,933 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:24:34,148 WARN L286 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:24:43,455 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:25:00,892 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:25:10,148 WARN L286 SmtUtils]: Spent 9.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:25:23,132 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:25:32,460 WARN L286 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:25:38,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1571.0 1000.0)))) (let ((.cse4 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse8 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (.cse2 (fp.neg .cse1)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse4 (let ((.cse5 (fp.div roundNearestTiesToEven .cse3 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 .cse5))) (fp.div roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse8 .cse6)))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (fp.gt ARCTAN_POS_~x .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse4 (let ((.cse9 (fp.div roundNearestTiesToEven .cse3 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse3 (let ((.cse10 (fp.mul roundNearestTiesToEven .cse9 .cse9))) (fp.div roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse8 .cse10)))))))) .cse1)) (fp.gt ARCTAN_POS_~x .cse3))) (exists ((ARCTAN_POS_~x (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse4 (let ((.cse11 (fp.div roundNearestTiesToEven .cse3 ARCTAN_POS_~x))) (fp.mul roundNearestTiesToEven .cse11 (fp.sub roundNearestTiesToEven .cse3 (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 .cse11))) (fp.div roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse8 .cse12)))))))) .cse2)) (fp.gt ARCTAN_POS_~x .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2024-11-13 13:25:51,741 WARN L286 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:26:01,208 WARN L286 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:26:14,254 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:26:23,255 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:26:27,943 WARN L851 $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.leq (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.geq (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)))))))) (fp.neg .cse6))) (fp.gt ARCTAN_POS_~x .cse2))))) is different from false [2024-11-13 13:26:32,110 WARN L873 $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.leq (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.geq (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)))))))) (fp.neg .cse6))) (fp.gt ARCTAN_POS_~x .cse2))))) is different from true [2024-11-13 13:26:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:26:32,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:26:32,112 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:26:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234725949] [2024-11-13 13:26:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234725949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:26:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:26:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:26:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254873755] [2024-11-13 13:26:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:26:32,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:26:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:26:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:26:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=12, Unknown=10, NotChecked=88, Total=132 [2024-11-13 13:26:32,116 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-13 13:26:37,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:26:42,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:26:46,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:26:52,810 WARN L851 $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~ret8#1|) (fp.gt ARCTAN_POS_~x .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 13:26:56,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:26:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:26:56,158 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-13 13:26:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:26:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2024-11-13 13:26:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:26:56,162 INFO L225 Difference]: With dead ends: 32 [2024-11-13 13:26:56,163 INFO L226 Difference]: Without dead ends: 27 [2024-11-13 13:26:56,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=24, Invalid=13, Unknown=11, NotChecked=108, Total=156 [2024-11-13 13:26:56,164 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:26:56,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 276 Unchecked, 19.4s Time] [2024-11-13 13:26:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-13 13:26:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-13 13:26:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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) [2024-11-13 13:26:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-13 13:26:56,174 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2024-11-13 13:26:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:26:56,175 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-13 13:26:56,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-13 13:26:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-13 13:26:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:26:56,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:26:56,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:26:56,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 13:26:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:26:56,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:26:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:26:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -769691898, now seen corresponding path program 1 times [2024-11-13 13:26:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:26:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755104408] [2024-11-13 13:26:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:56,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 [2024-11-13 13:26:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:26:56,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:26:56,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:27:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 13:27:24,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:27:39,033 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:27:47,624 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:27:56,168 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:04,514 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:08,666 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_~x#1| |c_ARCTAN_0_1_~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_ARCTAN_0_1_PADE_2_2_#res#1|) (= |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_~x#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:28:18,037 WARN L286 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:26,425 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:35,114 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:39,318 WARN L851 $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 [2024-11-13 13:28:48,609 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:28:57,011 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:05,701 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:14,430 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:23,715 WARN L286 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:28,417 WARN L851 $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 [2024-11-13 13:29:37,183 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:46,362 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:29:51,006 WARN L851 $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 [2024-11-13 13:29:59,843 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:09,048 WARN L286 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:18,276 WARN L286 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:27,517 WARN L286 SmtUtils]: Spent 9.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:31,913 WARN L851 $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 [2024-11-13 13:30:40,881 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:50,095 WARN L286 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:54,603 WARN L851 $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 [2024-11-13 13:31:08,366 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:17,518 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:26,681 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:44,256 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:53,551 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:06,594 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:15,843 WARN L286 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:20,406 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 13:32:20,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 13:32:20,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:32:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755104408] [2024-11-13 13:32:20,408 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 13:32:20,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:32:20,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:32:20,609 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-13 13:32:20,615 INFO L158 Benchmark]: Toolchain (without parser) took 858996.17ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.6MB in the end (delta: 12.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:20,616 INFO L158 Benchmark]: CDTParser took 1.63ms. Allocated memory is still 117.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:20,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.39ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:20,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:20,617 INFO L158 Benchmark]: Boogie Preprocessor took 55.05ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:20,617 INFO L158 Benchmark]: RCFGBuilder took 7928.31ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 66.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:20,618 INFO L158 Benchmark]: TraceAbstraction took 850666.33ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 79.6MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:20,622 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63ms. Allocated memory is still 117.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.39ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.05ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 7928.31ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 66.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 850666.33ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 79.6MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d5b5c22-b986-4e1c-be79-511ed3cbfcc0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")