./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cos_polynomial.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya --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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:54:04,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:54:04,832 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:54:04,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:54:04,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:54:04,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:54:04,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:54:04,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:54:04,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:54:04,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:54:04,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:54:04,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:54:04,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:54:04,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:54:04,869 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:54:04,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:54:04,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:54:04,871 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:54:04,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:54:04,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:54:04,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:54:04,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:54:04,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:54:04,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:54:04,875 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:54:04,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:54:04,876 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:54:04,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:54:04,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:54:04,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:54:04,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:54:04,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:04,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:54:04,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:54:04,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:54:04,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:54:04,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:54:04,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:54:04,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:54:04,882 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:54:04,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:54:04,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:54:04,883 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2023-11-29 05:54:05,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:54:05,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:54:05,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:54:05,122 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:54:05,122 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:54:05,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2023-11-29 05:54:08,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:54:08,238 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:54:08,239 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c [2023-11-29 05:54:08,247 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/9ad7252f4/7f641d57a21c4f4481422a112b1d0dbd/FLAG28ee709e7 [2023-11-29 05:54:08,259 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/9ad7252f4/7f641d57a21c4f4481422a112b1d0dbd [2023-11-29 05:54:08,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:54:08,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:54:08,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:08,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:54:08,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:54:08,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a694e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08, skipping insertion in model container [2023-11-29 05:54:08,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:54:08,450 WARN L240 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_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2023-11-29 05:54:08,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:08,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:54:08,495 WARN L240 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_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2023-11-29 05:54:08,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:08,519 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:54:08,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08 WrapperNode [2023-11-29 05:54:08,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:08,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:08,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:54:08,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:54:08,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,551 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 59 [2023-11-29 05:54:08,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:08,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:54:08,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:54:08,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:54:08,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,578 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]. [2023-11-29 05:54:08,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:54:08,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:54:08,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:54:08,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:54:08,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (1/1) ... [2023-11-29 05:54:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:08,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:54:08,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:54:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:54:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:54:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:54:08,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:54:08,747 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:54:08,749 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:54:08,878 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:54:08,907 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:54:08,907 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:54:08,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:08 BoogieIcfgContainer [2023-11-29 05:54:08,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:54:08,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:54:08,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:54:08,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:54:08,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:54:08" (1/3) ... [2023-11-29 05:54:08,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5b89c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:08, skipping insertion in model container [2023-11-29 05:54:08,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:08" (2/3) ... [2023-11-29 05:54:08,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5b89c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:08, skipping insertion in model container [2023-11-29 05:54:08,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:08" (3/3) ... [2023-11-29 05:54:08,920 INFO L112 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2023-11-29 05:54:08,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:54:08,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:54:09,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:54:09,015 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24706510, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:54:09,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:54:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:54:09,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:09,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:09,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:09,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1854402494, now seen corresponding path program 1 times [2023-11-29 05:54:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966141083] [2023-11-29 05:54:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:54:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:54:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966141083] [2023-11-29 05:54:09,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966141083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895783730] [2023-11-29 05:54:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:09,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:54:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:54:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:54:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:54:09,271 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:54:09,294 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-29 05:54:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:54:09,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 05:54:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:54:09,306 INFO L225 Difference]: With dead ends: 26 [2023-11-29 05:54:09,306 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 05:54:09,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:54:09,313 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:54:09,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:54:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 05:54:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 05:54:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 05:54:09,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-11-29 05:54:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:54:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 05:54:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 05:54:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:54:09,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:09,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:54:09,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:09,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1631218176, now seen corresponding path program 1 times [2023-11-29 05:54:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688139671] [2023-11-29 05:54:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:54:09,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:54:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:54:09,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:54:09,422 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:54:09,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:54:09,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:54:09,431 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 05:54:09,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:54:09,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:54:09 BoogieIcfgContainer [2023-11-29 05:54:09,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:54:09,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:54:09,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:54:09,462 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:54:09,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:08" (3/4) ... [2023-11-29 05:54:09,465 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:54:09,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:54:09,468 INFO L158 Benchmark]: Toolchain (without parser) took 1204.89ms. Allocated memory is still 144.7MB. Free memory was 113.7MB in the beginning and 63.6MB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,468 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:09,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.01ms. Allocated memory is still 144.7MB. Free memory was 113.3MB in the beginning and 102.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.81ms. Allocated memory is still 144.7MB. Free memory was 102.6MB in the beginning and 100.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,470 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,471 INFO L158 Benchmark]: RCFGBuilder took 316.94ms. Allocated memory is still 144.7MB. Free memory was 99.3MB in the beginning and 88.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,471 INFO L158 Benchmark]: TraceAbstraction took 549.69ms. Allocated memory is still 144.7MB. Free memory was 88.4MB in the beginning and 64.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:54:09,472 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 144.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:09,475 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.16ms. Allocated memory is still 100.7MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.01ms. Allocated memory is still 144.7MB. Free memory was 113.3MB in the beginning and 102.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.81ms. Allocated memory is still 144.7MB. Free memory was 102.6MB in the beginning and 100.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.94ms. Allocated memory is still 144.7MB. Free memory was 99.3MB in the beginning and 88.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 549.69ms. Allocated memory is still 144.7MB. Free memory was 88.4MB in the beginning and 64.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 144.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L16] double C1 = 4.16666666666666019037e-02; [L17] double C2 = -1.38888888888741095749e-03; [L18] double C3 = 2.48015872894767294178e-05; [L19] double C4 = -2.75573143513906633035e-07; [L20] double C5 = 2.08757232129817482790e-09; [L21] double C6 = -1.13596475577881948265e-11; [L49] double a, r; [L51] a = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(a >= -0.5 && a <= 0.75) [L12] COND FALSE !(!cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(cond)=1, cond=1] [L52] RET assume_abort_if_not(a >= -0.5 && a <= 0.75) [L54] CALL, EXPR mcos(a) [L25] double a, hz, z, r, qx, zr; [L26] z = x*x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(x)=53, x=53] [L27] COND TRUE x < 0. [L27] x = -x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(x)=53] [L28] hz = 0.5 * z [L29] r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*C6))))) [L30] zr = z*r VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(x)=53] [L31] COND TRUE x < 0.3 [L32] return 1.-(hz-zr); VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(x)=53] [L54] RET, EXPR mcos(a) [L54] r = mcos(a) [L56] CALL __VERIFIER_assert(r >= 0. && r <= 1.1) [L14] COND TRUE !(cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(cond)=0, cond=0] [L14] reach_error() VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000, \old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, 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, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:54:09,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya --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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:54:11,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:54:11,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:54:11,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:54:11,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:54:11,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:54:11,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:54:11,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:54:11,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:54:11,779 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:54:11,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:54:11,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:54:11,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:54:11,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:54:11,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:54:11,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:54:11,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:54:11,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:54:11,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:54:11,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:54:11,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:54:11,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:54:11,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:54:11,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:54:11,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:54:11,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:54:11,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:54:11,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:54:11,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:54:11,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:54:11,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:54:11,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:54:11,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:54:11,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:11,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:54:11,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:54:11,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:54:11,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:54:11,792 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:54:11,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:54:11,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:54:11,793 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:54:11,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:54:11,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:54:11,793 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:54:11,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2023-11-29 05:54:12,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:54:12,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:54:12,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:54:12,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:54:12,159 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:54:12,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2023-11-29 05:54:15,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:54:15,218 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:54:15,219 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c [2023-11-29 05:54:15,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/162ed1ed0/fce41c3e09d4407f8d552fefc4f229ab/FLAG93bbe2770 [2023-11-29 05:54:15,241 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/data/162ed1ed0/fce41c3e09d4407f8d552fefc4f229ab [2023-11-29 05:54:15,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:54:15,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:54:15,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:15,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:54:15,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:54:15,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdced1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15, skipping insertion in model container [2023-11-29 05:54:15,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,274 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:54:15,416 WARN L240 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_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2023-11-29 05:54:15,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:15,452 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:54:15,463 WARN L240 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_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2023-11-29 05:54:15,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:15,491 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:54:15,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15 WrapperNode [2023-11-29 05:54:15,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:15,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:15,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:54:15,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:54:15,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,535 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2023-11-29 05:54:15,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:15,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:54:15,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:54:15,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:54:15,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,572 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]. [2023-11-29 05:54:15,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:54:15,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:54:15,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:54:15,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:54:15,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (1/1) ... [2023-11-29 05:54:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:15,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:54:15,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:54:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:54:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:54:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:54:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:54:15,804 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:54:15,807 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:54:26,016 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:54:26,054 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:54:26,055 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:54:26,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:26 BoogieIcfgContainer [2023-11-29 05:54:26,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:54:26,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:54:26,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:54:26,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:54:26,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:54:15" (1/3) ... [2023-11-29 05:54:26,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:26, skipping insertion in model container [2023-11-29 05:54:26,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:15" (2/3) ... [2023-11-29 05:54:26,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:26, skipping insertion in model container [2023-11-29 05:54:26,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:26" (3/3) ... [2023-11-29 05:54:26,068 INFO L112 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2023-11-29 05:54:26,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:54:26,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:54:26,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:54:26,139 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@417ac410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:54:26,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:54:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:54:26,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:26,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:26,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:26,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1854402494, now seen corresponding path program 1 times [2023-11-29 05:54:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000067310] [2023-11-29 05:54:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:26,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:26,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:26,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:26,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:54:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:28,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:54:28,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:54:28,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:28,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000067310] [2023-11-29 05:54:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000067310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:28,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358661988] [2023-11-29 05:54:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:28,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:54:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:54:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:54:28,702 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:54:28,743 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-29 05:54:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:54:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 05:54:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:54:28,752 INFO L225 Difference]: With dead ends: 26 [2023-11-29 05:54:28,752 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 05:54:28,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:54:28,758 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:54:28,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:54:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 05:54:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 05:54:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 05:54:28,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-11-29 05:54:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:54:28,783 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 05:54:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 05:54:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:54:28,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:28,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:28,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:54:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:28,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:54:28,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1631218176, now seen corresponding path program 1 times [2023-11-29 05:54:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355104244] [2023-11-29 05:54:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:28,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:28,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:28,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:56:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:46,534 WARN L260 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 05:56:46,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:24,537 WARN L293 SmtUtils]: Spent 18.54s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:57:54,764 WARN L293 SmtUtils]: Spent 16.39s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:58:04,725 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:14,670 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:23,670 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:33,668 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:43,798 WARN L293 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:58:48,274 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_mcos_~hz~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (= (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))) |c_ULTIMATE.start_mcos_~zr~0#1|) (fp.geq |v_ULTIMATE.start_mcos_~x#1_11| (fp.neg .cse0)) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= |c_ULTIMATE.start_mcos_~x#1| (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 05:58:57,396 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:59:07,842 WARN L293 SmtUtils]: Spent 10.45s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:59:21,607 WARN L293 SmtUtils]: Spent 10.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:59:26,204 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res#1|))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 05:59:44,602 WARN L293 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:59:55,143 WARN L293 SmtUtils]: Spent 10.54s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:00:05,563 WARN L293 SmtUtils]: Spent 10.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:00:19,238 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:00:30,314 WARN L293 SmtUtils]: Spent 11.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:00:40,833 WARN L293 SmtUtils]: Spent 10.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:00:56,679 WARN L293 SmtUtils]: Spent 11.18s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:01:08,215 WARN L293 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:01:19,842 WARN L293 SmtUtils]: Spent 11.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:01:31,422 WARN L293 SmtUtils]: Spent 11.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:01:37,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse7 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse9 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse11 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse3 (let ((.cse5 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) (fp.mul roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse5 .cse11))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse3 (let ((.cse12 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse12) (fp.mul roundNearestTiesToEven .cse12 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse12 .cse11))))))))))))))) .cse1)) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse3 (let ((.cse13 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse13) (fp.mul roundNearestTiesToEven .cse13 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse13 .cse11))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2023-11-29 06:01:51,136 WARN L293 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:02,479 WARN L293 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:14,319 WARN L293 SmtUtils]: Spent 11.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:28,263 WARN L293 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:40,334 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:52,398 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:02:58,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse2 .cse8))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse10 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse10 .cse8))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))))) is different from false [2023-11-29 06:03:02,815 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse2 .cse8))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse10 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse10 .cse8))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))))) is different from true [2023-11-29 06:03:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:03:02,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:03:02,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:03:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355104244] [2023-11-29 06:03:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355104244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:03:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:03:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:03:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305215209] [2023-11-29 06:03:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:03:02,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:03:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:03:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:03:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=23, Unknown=6, NotChecked=44, Total=90 [2023-11-29 06:03:02,821 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:03:06,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:03:45,512 WARN L293 SmtUtils]: Spent 32.18s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:03:47,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:03:51,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:04:37,569 WARN L293 SmtUtils]: Spent 31.17s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:04:40,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:04:45,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:04:51,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:04:55,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:04:59,722 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 [0] [2023-11-29 06:05:04,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (let ((.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse7 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse5 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse8 (fp.neg .cse0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)))) (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (and (= |c_ULTIMATE.start_mcos_~hz~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (= (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode .cse1 .cse7)))))))))))) |c_ULTIMATE.start_mcos_~zr~0#1|) (fp.geq |v_ULTIMATE.start_mcos_~x#1_11| .cse8) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= |c_ULTIMATE.start_mcos_~x#1| (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|))))) (= c_~C2~0 .cse3) (fp.geq |c_ULTIMATE.start_main_~a~1#1| .cse8) (= .cse6 c_~C5~0) (= c_~C6~0 .cse7) (= .cse5 c_~C4~0) (= .cse4 c_~C3~0) (fp.leq |c_ULTIMATE.start_main_~a~1#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_mcos_~x#1_11| .cse8) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= |c_ULTIMATE.start_mcos_~x#1| (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|)) (= |c_ULTIMATE.start_mcos_~z~0#1| (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|)))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 c_~C1~0)))) is different from false [2023-11-29 06:05:11,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:15,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:19,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:05:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:27,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:31,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:05:34,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:35,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:05:38,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:41,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:43,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:48,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:52,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:05:55,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:05:59,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:06:03,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:06:07,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:06:11,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:06:15,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:06:19,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:06:23,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:06:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:23,906 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-11-29 06:06:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:06:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 06:06:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:23,918 INFO L225 Difference]: With dead ends: 28 [2023-11-29 06:06:23,918 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 06:06:23,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 161.0s TimeCoverageRelationStatistics Valid=31, Invalid=50, Unknown=11, NotChecked=90, Total=182 [2023-11-29 06:06:23,921 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 110.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:23,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 20 Unknown, 104 Unchecked, 110.9s Time] [2023-11-29 06:06:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 06:06:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2023-11-29 06:06:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-11-29 06:06:23,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-11-29 06:06:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:23,929 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-29 06:06:23,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-11-29 06:06:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 06:06:23,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:23,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:23,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:06:24,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:24,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:06:24,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1688476478, now seen corresponding path program 1 times [2023-11-29 06:06:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927782353] [2023-11-29 06:06:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:24,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:24,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:06:24,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_874e3b0e-403d-4883-b5ca-f2a1ac5c8915/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:08:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:08:00,394 WARN L260 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 06:08:00,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:08:58,764 WARN L293 SmtUtils]: Spent 22.66s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)