./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04255db23fa2b33ef965cf216e618982ce4f05405d3eba07d1c5e94169a40ce3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 19:31:13,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:31:13,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:31:13,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:31:13,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:31:13,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:31:13,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:31:13,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:31:13,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:31:13,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:31:13,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:31:13,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:31:13,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:31:13,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:31:13,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:31:13,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:31:13,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:31:13,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:31:13,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:31:13,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:31:13,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:31:13,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:31:13,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:31:13,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:31:13,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:31:13,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:31:13,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:31:13,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:31:13,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:31:13,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:31:13,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:31:13,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:31:13,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:31:13,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:31:13,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:31:13,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:31:13,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:31:13,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:31:13,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:31:13,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:31:13,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:31:13,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 19:31:13,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:31:13,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:31:13,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:31:13,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:31:13,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:31:13,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:31:13,304 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:31:13,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:31:13,305 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:31:13,305 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:31:13,306 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:31:13,306 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:31:13,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:31:13,307 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:31:13,308 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:31:13,308 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:31:13,308 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:31:13,309 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:31:13,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:31:13,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:31:13,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:31:13,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:31:13,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:31:13,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:31:13,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:31:13,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:31:13,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:31:13,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:31:13,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:31:13,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:31:13,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:31:13,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:31:13,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:13,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:31:13,317 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:31:13,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:31:13,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:31:13,319 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:31:13,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:31:13,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:31:13,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:31:13,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 04255db23fa2b33ef965cf216e618982ce4f05405d3eba07d1c5e94169a40ce3 [2022-11-16 19:31:13,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:31:13,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:31:13,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:31:13,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:31:13,703 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:31:13,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-11-16 19:31:13,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/0ab7e130e/162b0de653674c2db1a9c412a2ec5d0c/FLAGaf32d0dc2 [2022-11-16 19:31:14,318 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:31:14,318 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-11-16 19:31:14,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/0ab7e130e/162b0de653674c2db1a9c412a2ec5d0c/FLAGaf32d0dc2 [2022-11-16 19:31:14,780 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/0ab7e130e/162b0de653674c2db1a9c412a2ec5d0c [2022-11-16 19:31:14,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:31:14,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:31:14,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:14,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:31:14,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:31:14,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:14" (1/1) ... [2022-11-16 19:31:14,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7330e188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:14, skipping insertion in model container [2022-11-16 19:31:14,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:14" (1/1) ... [2022-11-16 19:31:14,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:31:14,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:31:15,198 WARN L229 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_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c[6873,6886] [2022-11-16 19:31:15,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:15,209 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:31:15,295 WARN L229 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_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c[6873,6886] [2022-11-16 19:31:15,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:15,332 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:31:15,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15 WrapperNode [2022-11-16 19:31:15,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:15,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:15,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:31:15,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:31:15,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,409 INFO L138 Inliner]: procedures = 21, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2022-11-16 19:31:15,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:15,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:31:15,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:31:15,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:31:15,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:31:15,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:31:15,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:31:15,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:31:15,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (1/1) ... [2022-11-16 19:31:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:31:15,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:31:15,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:31:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:31:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:31:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:31:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-16 19:31:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:31:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-11-16 19:31:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-11-16 19:31:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-16 19:31:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-11-16 19:31:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-11-16 19:31:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:31:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:31:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 19:31:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-16 19:31:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:31:15,719 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:31:15,721 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:31:16,523 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:31:16,742 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:31:16,743 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-16 19:31:16,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:16 BoogieIcfgContainer [2022-11-16 19:31:16,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:31:16,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:31:16,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:31:16,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:31:16,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:31:14" (1/3) ... [2022-11-16 19:31:16,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41783c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:16, skipping insertion in model container [2022-11-16 19:31:16,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:15" (2/3) ... [2022-11-16 19:31:16,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41783c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:16, skipping insertion in model container [2022-11-16 19:31:16,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:16" (3/3) ... [2022-11-16 19:31:16,755 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682b.c [2022-11-16 19:31:16,774 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:31:16,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 19:31:16,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:31:16,862 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5042304c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:31:16,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 19:31:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 71 states have (on average 1.704225352112676) internal successors, (121), 72 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:31:16,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:16,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:16,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -298414451, now seen corresponding path program 1 times [2022-11-16 19:31:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:16,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650876840] [2022-11-16 19:31:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:31:17,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:17,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650876840] [2022-11-16 19:31:17,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650876840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:17,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:17,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:31:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248368998] [2022-11-16 19:31:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:31:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:17,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:31:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:31:17,215 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.704225352112676) internal successors, (121), 72 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-11-16 19:31:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:17,346 INFO L93 Difference]: Finished difference Result 157 states and 261 transitions. [2022-11-16 19:31:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:31:17,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-16 19:31:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:17,357 INFO L225 Difference]: With dead ends: 157 [2022-11-16 19:31:17,358 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 19:31:17,361 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 [2022-11-16 19:31:17,365 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:17,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:31:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 19:31:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 19:31:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-16 19:31:17,408 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 13 [2022-11-16 19:31:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:17,409 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-16 19:31:17,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-11-16 19:31:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-16 19:31:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:31:17,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:17,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:17,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:31:17,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1894147791, now seen corresponding path program 1 times [2022-11-16 19:31:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:17,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957678723] [2022-11-16 19:31:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:31:17,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957678723] [2022-11-16 19:31:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957678723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:17,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:31:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162098632] [2022-11-16 19:31:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:31:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:31:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:17,638 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-11-16 19:31:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:17,718 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2022-11-16 19:31:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:31:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-11-16 19:31:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:17,720 INFO L225 Difference]: With dead ends: 144 [2022-11-16 19:31:17,720 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 19:31:17,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:17,723 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:17,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:31:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 19:31:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 19:31:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2022-11-16 19:31:17,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 16 [2022-11-16 19:31:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:17,733 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2022-11-16 19:31:17,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-11-16 19:31:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2022-11-16 19:31:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 19:31:17,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:17,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:17,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:31:17,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -577975455, now seen corresponding path program 1 times [2022-11-16 19:31:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:17,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487755106] [2022-11-16 19:31:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:31:18,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:31:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:31:18,684 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 19:31:18,685 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:31:18,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 19:31:18,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:31:18,692 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 19:31:18,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:31:18,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:31:18 BoogieIcfgContainer [2022-11-16 19:31:18,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:31:18,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:31:18,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:31:18,776 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:31:18,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:16" (3/4) ... [2022-11-16 19:31:18,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 19:31:18,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:31:18,783 INFO L158 Benchmark]: Toolchain (without parser) took 3994.42ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 56.8MB in the beginning and 64.8MB in the end (delta: -8.1MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,784 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 94.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:31:18,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.44ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 64.8MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.68ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 61.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,792 INFO L158 Benchmark]: Boogie Preprocessor took 65.52ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 58.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,794 INFO L158 Benchmark]: RCFGBuilder took 1263.17ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.9MB in the beginning and 59.4MB in the end (delta: -1.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,795 INFO L158 Benchmark]: TraceAbstraction took 2025.95ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 58.9MB in the beginning and 64.8MB in the end (delta: -5.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-11-16 19:31:18,795 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 144.7MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:31:18,799 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 94.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.44ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 64.8MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.68ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 61.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.52ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 58.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1263.17ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.9MB in the beginning and 59.4MB in the end (delta: -1.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2025.95ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 58.9MB in the beginning and 64.8MB in the end (delta: -5.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 144.7MB. Free memory is still 64.8MB. 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: 287]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of bitwiseAnd at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 286. Possible FailurePath: [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L278] double x = -1.0 / 0.0; [L279] double y = __VERIFIER_nondet_double(); [L281] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L250] ieee_double_shape_type ew_u; [L251] ew_u.value = (x) [L252] EXPR ew_u.parts.msw [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw [L253] (lx) = ew_u.parts.lsw [L255] hx &= 0x7fffffff [L256] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L257] hx = 0x7ff00000 - hx [L258] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L281] RET, EXPR isinf_double(x) [L281] EXPR isinf_double(x) && isfinite_double(y) [L281] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L264] ieee_double_shape_type gh_u; [L265] gh_u.value = (x) [L266] EXPR gh_u.parts.msw [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); [L281] RET, EXPR isfinite_double(y) [L281] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isfinite_double(y)=-1, isinf_double(x)=-1, isinf_double(x) && isfinite_double(y)=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L281] COND TRUE isinf_double(x) && isfinite_double(y) && y > 0.0 [L283] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L150] ieee_double_shape_type ew_u; [L151] ew_u.value = (x) [L152] EXPR ew_u.parts.msw [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2147483647, ix=2146435073, lx=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L157] ieee_double_shape_type ew_u; [L158] ew_u.value = (y) [L159] EXPR ew_u.parts.msw [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2147483647, hy=-3, ix=2146435073, iy=2147483648, lx=0, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2147483647, hy=-3, ix=2146435073, iy=2147483648, lx=0, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L283] RET, EXPR __ieee754_atan2(y, x) [L283] double res = __ieee754_atan2(y, x); [L286] COND TRUE res != pi VAL [aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] [L287] reach_error() VAL [aT_atan={4:0}, atanhi_atan={5:0}, atanlo_atan={6:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 179 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2022-11-16 19:31:18,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04255db23fa2b33ef965cf216e618982ce4f05405d3eba07d1c5e94169a40ce3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 19:31:21,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:31:21,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:31:21,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:31:21,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:31:21,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:31:21,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:31:21,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:31:21,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:31:21,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:31:21,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:31:21,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:31:21,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:31:21,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:31:21,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:31:21,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:31:21,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:31:21,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:31:21,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:31:21,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:31:21,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:31:21,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:31:21,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:31:21,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:31:21,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:31:21,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:31:21,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:31:21,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:31:21,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:31:21,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:31:21,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:31:21,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:31:21,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:31:21,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:31:21,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:31:21,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:31:21,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:31:21,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:31:21,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:31:21,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:31:21,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:31:21,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-16 19:31:21,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:31:21,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:31:21,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:31:21,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:31:21,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:31:21,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:31:21,359 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:31:21,359 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:31:21,359 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:31:21,359 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:31:21,360 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:31:21,360 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:31:21,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:31:21,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:31:21,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:31:21,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:31:21,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:31:21,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:31:21,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:31:21,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:31:21,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:31:21,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:31:21,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 19:31:21,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:31:21,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:21,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:31:21,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:31:21,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:31:21,367 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 19:31:21,367 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 19:31:21,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:31:21,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:31:21,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 19:31:21,368 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 04255db23fa2b33ef965cf216e618982ce4f05405d3eba07d1c5e94169a40ce3 [2022-11-16 19:31:21,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:31:21,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:31:21,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:31:21,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:31:21,799 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:31:21,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-11-16 19:31:21,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/828385979/87ee09e5645140f7aa448143199e4ffe/FLAG599a46d50 [2022-11-16 19:31:22,493 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:31:22,494 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-11-16 19:31:22,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/828385979/87ee09e5645140f7aa448143199e4ffe/FLAG599a46d50 [2022-11-16 19:31:22,792 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/data/828385979/87ee09e5645140f7aa448143199e4ffe [2022-11-16 19:31:22,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:31:22,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:31:22,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:22,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:31:22,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:31:22,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:22" (1/1) ... [2022-11-16 19:31:22,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4c7064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:22, skipping insertion in model container [2022-11-16 19:31:22,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:22" (1/1) ... [2022-11-16 19:31:22,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:31:22,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:31:23,238 WARN L229 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_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c[6873,6886] [2022-11-16 19:31:23,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:23,259 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:31:23,347 WARN L229 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_8580981c-ee6b-48b4-a6ef-decab893156d/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c[6873,6886] [2022-11-16 19:31:23,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:23,388 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:31:23,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23 WrapperNode [2022-11-16 19:31:23,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:23,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:23,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:31:23,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:31:23,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,466 INFO L138 Inliner]: procedures = 24, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 268 [2022-11-16 19:31:23,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:23,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:31:23,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:31:23,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:31:23,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,540 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:31:23,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:31:23,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:31:23,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:31:23,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (1/1) ... [2022-11-16 19:31:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:23,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:31:23,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:31:23,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:31:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:31:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-16 19:31:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-11-16 19:31:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 19:31:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:31:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-11-16 19:31:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-11-16 19:31:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-11-16 19:31:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-11-16 19:31:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-11-16 19:31:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 19:31:23,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:31:23,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:31:23,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 19:31:23,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:31:23,781 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:31:23,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:31:49,168 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:31:49,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:31:49,177 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-16 19:31:49,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:49 BoogieIcfgContainer [2022-11-16 19:31:49,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:31:49,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:31:49,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:31:49,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:31:49,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:31:22" (1/3) ... [2022-11-16 19:31:49,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7284c2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:49, skipping insertion in model container [2022-11-16 19:31:49,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:23" (2/3) ... [2022-11-16 19:31:49,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7284c2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:49, skipping insertion in model container [2022-11-16 19:31:49,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:49" (3/3) ... [2022-11-16 19:31:49,191 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682b.c [2022-11-16 19:31:49,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:31:49,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 19:31:49,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:31:49,269 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@fc60140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:31:49,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 19:31:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 90 states have internal predecessors, (148), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:31:49,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:49,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:49,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1890267110, now seen corresponding path program 1 times [2022-11-16 19:31:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:31:49,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767738496] [2022-11-16 19:31:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:49,304 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 [2022-11-16 19:31:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:31:49,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:31:49,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:49,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 19:31:49,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:31:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:31:49,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:31:49,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:31:49,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767738496] [2022-11-16 19:31:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767738496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:49,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:49,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:31:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011184851] [2022-11-16 19:31:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:31:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:31:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:31:49,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:31:49,843 INFO L87 Difference]: Start difference. First operand has 97 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 90 states have internal predecessors, (148), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:49,892 INFO L93 Difference]: Finished difference Result 192 states and 314 transitions. [2022-11-16 19:31:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:31:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:31:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:49,903 INFO L225 Difference]: With dead ends: 192 [2022-11-16 19:31:49,903 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:31:49,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:31:49,910 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:49,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 19:31:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:31:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:31:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2022-11-16 19:31:49,953 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 15 [2022-11-16 19:31:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:49,954 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2022-11-16 19:31:49,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2022-11-16 19:31:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 19:31:49,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:49,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:49,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:50,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:50,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1206213533, now seen corresponding path program 1 times [2022-11-16 19:31:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:31:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662999515] [2022-11-16 19:31:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:50,176 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 [2022-11-16 19:31:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:31:50,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:31:50,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:50,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 19:31:50,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:31:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:31:50,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:31:50,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:31:50,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662999515] [2022-11-16 19:31:50,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662999515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:50,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:50,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:31:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719647888] [2022-11-16 19:31:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:50,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:31:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:31:50,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:31:50,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:50,872 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) [2022-11-16 19:31:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:51,079 INFO L93 Difference]: Finished difference Result 175 states and 248 transitions. [2022-11-16 19:31:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:31:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Word has length 18 [2022-11-16 19:31:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:51,083 INFO L225 Difference]: With dead ends: 175 [2022-11-16 19:31:51,084 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:31:51,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:51,088 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:51,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:31:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:31:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:31:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:31:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2022-11-16 19:31:51,113 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 18 [2022-11-16 19:31:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:51,114 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2022-11-16 19:31:51,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) [2022-11-16 19:31:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-11-16 19:31:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 19:31:51,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:51,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:51,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 19:31:51,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:51,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:31:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1202351854, now seen corresponding path program 1 times [2022-11-16 19:31:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:31:51,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806130672] [2022-11-16 19:31:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:51,327 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 [2022-11-16 19:31:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:31:51,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:31:51,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:31:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:51,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-16 19:31:51,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:31:52,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-11-16 19:31:54,483 INFO L321 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-11-16 19:31:54,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2022-11-16 19:31:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:31:59,122 INFO L321 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-11-16 19:31:59,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-11-16 19:32:01,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:32:01,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2022-11-16 19:32:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:09,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:09,278 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:09,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806130672] [2022-11-16 19:32:09,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806130672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:09,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:09,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:32:09,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237660685] [2022-11-16 19:32:09,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:09,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 19:32:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 19:32:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=130, Unknown=2, NotChecked=0, Total=156 [2022-11-16 19:32:09,281 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2022-11-16 19:32:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:09,326 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-11-16 19:32:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:32:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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 22 [2022-11-16 19:32:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:09,328 INFO L225 Difference]: With dead ends: 97 [2022-11-16 19:32:09,328 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:32:09,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=24, Invalid=130, Unknown=2, NotChecked=0, Total=156 [2022-11-16 19:32:09,329 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:09,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1267 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 150 Unchecked, 0.0s Time] [2022-11-16 19:32:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:32:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:32:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2022-11-16 19:32:09,346 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 22 [2022-11-16 19:32:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2022-11-16 19:32:09,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2022-11-16 19:32:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2022-11-16 19:32:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 19:32:09,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:09,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:09,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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)] Forceful destruction successful, exit code 0 [2022-11-16 19:32:09,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:09,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 628413096, now seen corresponding path program 1 times [2022-11-16 19:32:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:09,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647109069] [2022-11-16 19:32:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:09,586 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 [2022-11-16 19:32:09,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:09,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:09,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (5)] Waiting until timeout for monitored process [2022-11-16 19:32:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:10,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 19:32:10,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:12,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:12,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647109069] [2022-11-16 19:32:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647109069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:12,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:32:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265955259] [2022-11-16 19:32:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:32:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:12,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:32:12,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:12,081 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-11-16 19:32:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:12,094 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2022-11-16 19:32:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:32:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2022-11-16 19:32:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:12,095 INFO L225 Difference]: With dead ends: 101 [2022-11-16 19:32:12,096 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:32:12,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:12,097 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 16 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:12,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 584 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-11-16 19:32:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:32:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:32:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2022-11-16 19:32:12,107 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 25 [2022-11-16 19:32:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:12,108 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2022-11-16 19:32:12,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-11-16 19:32:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2022-11-16 19:32:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:32:12,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:12,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:12,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (5)] Forceful destruction successful, exit code 0 [2022-11-16 19:32:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:12,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1693886686, now seen corresponding path program 1 times [2022-11-16 19:32:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:12,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810279159] [2022-11-16 19:32:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:12,332 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 [2022-11-16 19:32:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:12,334 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:12,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (6)] Waiting until timeout for monitored process [2022-11-16 19:32:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:12,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 19:32:12,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:14,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:14,830 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:14,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810279159] [2022-11-16 19:32:14,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810279159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:14,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:14,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:32:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619386201] [2022-11-16 19:32:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:14,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:32:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:32:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:14,833 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-11-16 19:32:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:14,847 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2022-11-16 19:32:14,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:32:14,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2022-11-16 19:32:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:14,848 INFO L225 Difference]: With dead ends: 148 [2022-11-16 19:32:14,848 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:32:14,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:14,850 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:14,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 564 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-11-16 19:32:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:32:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:32:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2022-11-16 19:32:14,861 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 27 [2022-11-16 19:32:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:14,861 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-11-16 19:32:14,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-11-16 19:32:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2022-11-16 19:32:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:32:14,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:14,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:14,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (6)] Forceful destruction successful, exit code 0 [2022-11-16 19:32:15,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:15,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash 151539556, now seen corresponding path program 1 times [2022-11-16 19:32:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359209620] [2022-11-16 19:32:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:15,088 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 [2022-11-16 19:32:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:15,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:15,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (7)] Waiting until timeout for monitored process [2022-11-16 19:32:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:15,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 19:32:15,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:18,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:18,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:18,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359209620] [2022-11-16 19:32:18,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359209620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:18,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:18,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:32:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886763305] [2022-11-16 19:32:18,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:18,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:32:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:32:18,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:32:18,510 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-11-16 19:32:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:19,234 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2022-11-16 19:32:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:32:19,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2022-11-16 19:32:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:19,237 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:32:19,237 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:32:19,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:32:19,238 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:19,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 748 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 44 Unchecked, 0.7s Time] [2022-11-16 19:32:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:32:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-11-16 19:32:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2022-11-16 19:32:19,249 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 27 [2022-11-16 19:32:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:19,250 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2022-11-16 19:32:19,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-11-16 19:32:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2022-11-16 19:32:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:32:19,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:19,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:19,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (7)] Forceful destruction successful, exit code 0 [2022-11-16 19:32:19,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:19,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 94281254, now seen corresponding path program 1 times [2022-11-16 19:32:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:19,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113783151] [2022-11-16 19:32:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:19,476 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 [2022-11-16 19:32:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:19,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:19,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (8)] Waiting until timeout for monitored process [2022-11-16 19:32:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:19,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:32:19,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:21,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:21,952 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:21,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113783151] [2022-11-16 19:32:21,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113783151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:21,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:21,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:32:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373270995] [2022-11-16 19:32:21,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:32:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:32:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:32:21,955 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-11-16 19:32:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:22,515 INFO L93 Difference]: Finished difference Result 165 states and 227 transitions. [2022-11-16 19:32:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:32:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2022-11-16 19:32:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:22,519 INFO L225 Difference]: With dead ends: 165 [2022-11-16 19:32:22,519 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 19:32:22,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:32:22,521 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:22,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 648 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 30 Unchecked, 0.5s Time] [2022-11-16 19:32:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 19:32:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-11-16 19:32:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2022-11-16 19:32:22,530 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 27 [2022-11-16 19:32:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:22,530 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2022-11-16 19:32:22,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-11-16 19:32:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2022-11-16 19:32:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:32:22,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:22,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:22,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (8)] Ended with exit code 0 [2022-11-16 19:32:22,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:22,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1782996585, now seen corresponding path program 1 times [2022-11-16 19:32:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:22,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969130125] [2022-11-16 19:32:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:22,748 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 [2022-11-16 19:32:22,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:22,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:22,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (9)] Waiting until timeout for monitored process [2022-11-16 19:32:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:23,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 19:32:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:27,635 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_67| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_66| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_66|)))) (and (not (= (_ bv0 32) (bvlshr (bvadd (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_66|) (_ bv2147483647 32)) (_ bv2148532224 32)) (_ bv31 32)))) (= |c_ULTIMATE.start___ieee754_atan2_~hy~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_67|)) (fp.gt .cse0 (_ +zero 11 53)) (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_67|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_67|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_67|)))))) is different from true [2022-11-16 19:32:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:38,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:38,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969130125] [2022-11-16 19:32:38,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969130125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:38,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:38,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 19:32:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969580205] [2022-11-16 19:32:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:38,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 19:32:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 19:32:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=4, NotChecked=12, Total=72 [2022-11-16 19:32:38,822 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-11-16 19:32:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:41,089 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2022-11-16 19:32:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:32:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-11-16 19:32:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:41,090 INFO L225 Difference]: With dead ends: 156 [2022-11-16 19:32:41,090 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 19:32:41,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=19, Invalid=52, Unknown=5, NotChecked=14, Total=90 [2022-11-16 19:32:41,092 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:41,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 783 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 151 Unchecked, 0.0s Time] [2022-11-16 19:32:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 19:32:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-11-16 19:32:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-11-16 19:32:41,102 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 28 [2022-11-16 19:32:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:41,102 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-11-16 19:32:41,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-11-16 19:32:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-11-16 19:32:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:32:41,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:41,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:41,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (9)] Forceful destruction successful, exit code 0 [2022-11-16 19:32:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:41,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1805876073, now seen corresponding path program 1 times [2022-11-16 19:32:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:41,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812310249] [2022-11-16 19:32:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:41,320 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 [2022-11-16 19:32:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:41,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:41,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (10)] Waiting until timeout for monitored process [2022-11-16 19:32:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:41,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:32:41,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:43,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:43,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:43,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812310249] [2022-11-16 19:32:43,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812310249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:43,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:43,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:32:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283128097] [2022-11-16 19:32:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:43,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:32:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:32:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:32:43,909 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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) [2022-11-16 19:32:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:44,563 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2022-11-16 19:32:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:32:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-11-16 19:32:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:44,565 INFO L225 Difference]: With dead ends: 101 [2022-11-16 19:32:44,565 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:32:44,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:32:44,566 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:44,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 660 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 27 Unchecked, 0.6s Time] [2022-11-16 19:32:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:32:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-16 19:32:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:32:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2022-11-16 19:32:44,576 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 28 [2022-11-16 19:32:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:44,577 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2022-11-16 19:32:44,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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) [2022-11-16 19:32:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2022-11-16 19:32:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:32:44,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:44,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:44,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (10)] Ended with exit code 0 [2022-11-16 19:32:44,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:32:44,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:32:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash 400402884, now seen corresponding path program 1 times [2022-11-16 19:32:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:32:44,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603920969] [2022-11-16 19:32:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:44,800 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 [2022-11-16 19:32:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:32:44,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:32:44,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (11)] Waiting until timeout for monitored process [2022-11-16 19:32:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:45,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 19:32:45,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:50,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:32:50,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:32:50,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603920969] [2022-11-16 19:32:50,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603920969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783553141] [2022-11-16 19:32:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:50,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:32:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:32:50,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:32:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:50,194 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-11-16 19:33:00,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:01,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:05,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:07,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:12,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:14,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:16,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:17,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:18,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:19,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:21,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:25,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:28,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:31,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:34,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:37,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:39,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:33:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:40,367 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-11-16 19:33:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:33:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-11-16 19:33:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:40,370 INFO L225 Difference]: With dead ends: 104 [2022-11-16 19:33:40,371 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 19:33:40,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:33:40,372 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 95 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:40,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 274 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 47.3s Time] [2022-11-16 19:33:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 19:33:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-11-16 19:33:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:33:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-16 19:33:40,384 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 28 [2022-11-16 19:33:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:40,385 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-16 19:33:40,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-11-16 19:33:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-16 19:33:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:33:40,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:40,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:40,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (11)] Forceful destruction successful, exit code 0 [2022-11-16 19:33:40,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:33:40,601 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:33:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash 146865864, now seen corresponding path program 1 times [2022-11-16 19:33:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:33:40,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961907523] [2022-11-16 19:33:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:40,602 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 [2022-11-16 19:33:40,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:33:40,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:33:40,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (12)] Waiting until timeout for monitored process [2022-11-16 19:33:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:40,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 19:33:40,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:33:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:33:44,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:33:44,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:33:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961907523] [2022-11-16 19:33:44,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961907523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:44,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:44,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:33:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56941221] [2022-11-16 19:33:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:33:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:33:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:33:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:33:44,733 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-11-16 19:33:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:45,365 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2022-11-16 19:33:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:33:45,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-16 19:33:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:45,367 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:33:45,367 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:33:45,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:33:45,373 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:45,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 27 Unchecked, 0.6s Time] [2022-11-16 19:33:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:33:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 19:33:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:33:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-11-16 19:33:45,384 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 29 [2022-11-16 19:33:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:45,385 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-11-16 19:33:45,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-11-16 19:33:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-11-16 19:33:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:33:45,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:45,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:45,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (12)] Forceful destruction successful, exit code 0 [2022-11-16 19:33:45,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:33:45,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:33:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -474619585, now seen corresponding path program 1 times [2022-11-16 19:33:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:33:45,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746529302] [2022-11-16 19:33:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:45,596 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 [2022-11-16 19:33:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:33:45,597 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:33:45,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (13)] Waiting until timeout for monitored process [2022-11-16 19:33:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:46,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 19:33:46,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:33:47,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-11-16 19:33:48,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 19:33:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:33:52,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:33:52,105 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:33:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746529302] [2022-11-16 19:33:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746529302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:52,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:52,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:33:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003302376] [2022-11-16 19:33:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:33:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:33:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:33:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:33:52,107 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-11-16 19:33:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:52,119 INFO L93 Difference]: Finished difference Result 152 states and 199 transitions. [2022-11-16 19:33:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:33:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-16 19:33:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:52,121 INFO L225 Difference]: With dead ends: 152 [2022-11-16 19:33:52,121 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 19:33:52,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:33:52,123 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:52,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 619 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2022-11-16 19:33:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 19:33:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-16 19:33:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 19:33:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2022-11-16 19:33:52,132 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2022-11-16 19:33:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:52,132 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2022-11-16 19:33:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-11-16 19:33:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-11-16 19:33:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 19:33:52,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:52,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:52,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (13)] Forceful destruction successful, exit code 0 [2022-11-16 19:33:52,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:33:52,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:33:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash -613871581, now seen corresponding path program 1 times [2022-11-16 19:33:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:33:52,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182771946] [2022-11-16 19:33:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:52,348 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 [2022-11-16 19:33:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:33:52,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:33:52,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (14)] Waiting until timeout for monitored process [2022-11-16 19:33:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:52,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 19:33:52,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:33:53,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-11-16 19:33:54,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 19:33:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:33:59,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:33:59,677 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:33:59,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182771946] [2022-11-16 19:33:59,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182771946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:59,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:59,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:33:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699391148] [2022-11-16 19:33:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:59,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:33:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:33:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:33:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2022-11-16 19:33:59,679 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2022-11-16 19:33:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:59,688 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2022-11-16 19:33:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:33:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 31 [2022-11-16 19:33:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:59,690 INFO L225 Difference]: With dead ends: 116 [2022-11-16 19:33:59,690 INFO L226 Difference]: Without dead ends: 56 [2022-11-16 19:33:59,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2022-11-16 19:33:59,691 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:59,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-11-16 19:33:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-16 19:33:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-16 19:33:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 19:33:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-16 19:33:59,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 31 [2022-11-16 19:33:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:59,699 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-16 19:33:59,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2022-11-16 19:33:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-16 19:33:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 19:33:59,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:59,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:59,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (14)] Forceful destruction successful, exit code 0 [2022-11-16 19:33:59,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:33:59,915 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:33:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash 819116375, now seen corresponding path program 1 times [2022-11-16 19:33:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:33:59,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26100399] [2022-11-16 19:33:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:59,916 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 [2022-11-16 19:33:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:33:59,917 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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) [2022-11-16 19:33:59,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (15)] Waiting until timeout for monitored process [2022-11-16 19:34:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 19:34:00,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:34:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:34:02,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:34:02,074 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:34:02,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26100399] [2022-11-16 19:34:02,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26100399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:02,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:02,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:34:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146380996] [2022-11-16 19:34:02,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:34:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:34:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:34:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:34:02,077 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 19:34:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:02,090 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-16 19:34:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:34:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-16 19:34:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:02,090 INFO L225 Difference]: With dead ends: 56 [2022-11-16 19:34:02,091 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 19:34:02,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:34:02,092 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:02,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-11-16 19:34:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 19:34:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 19:34:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-11-16 19:34:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 19:34:02,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-16 19:34:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:02,094 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 19:34:02,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 19:34:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 19:34:02,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 19:34:02,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 19:34:02,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 (15)] Forceful destruction successful, exit code 0 [2022-11-16 19:34:02,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/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 [2022-11-16 19:34:02,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 19:34:06,435 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-11-16 19:34:06,435 INFO L902 garLoopResultBuilder]: At program point L26-1(lines 19 33) the Hoare annotation is: true [2022-11-16 19:34:06,435 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-11-16 19:34:06,435 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-11-16 19:34:06,436 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-11-16 19:34:06,436 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-11-16 19:34:06,436 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-11-16 19:34:06,436 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-11-16 19:34:06,436 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-11-16 19:34:06,436 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-16 19:34:06,436 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-11-16 19:34:06,437 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-11-16 19:34:06,437 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-11-16 19:34:06,437 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-11-16 19:34:06,437 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-11-16 19:34:06,437 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-11-16 19:34:06,437 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-11-16 19:34:06,438 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-11-16 19:34:06,438 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-11-16 19:34:06,438 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-11-16 19:34:06,438 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-11-16 19:34:06,438 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-11-16 19:34:06,439 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-11-16 19:34:06,439 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-11-16 19:34:06,439 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-11-16 19:34:06,439 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-11-16 19:34:06,440 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-11-16 19:34:06,440 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-11-16 19:34:06,440 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-11-16 19:34:06,440 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-11-16 19:34:06,440 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-11-16 19:34:06,440 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-11-16 19:34:06,441 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-11-16 19:34:06,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 19:34:06,441 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-11-16 19:34:06,441 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-11-16 19:34:06,442 INFO L895 garLoopResultBuilder]: At program point L268(lines 261 269) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_double_#res#1| (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-11-16 19:34:06,442 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-11-16 19:34:06,442 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-11-16 19:34:06,442 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-11-16 19:34:06,443 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-11-16 19:34:06,443 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 289) no Hoare annotation was computed. [2022-11-16 19:34:06,443 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-11-16 19:34:06,443 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-11-16 19:34:06,443 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-11-16 19:34:06,444 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-11-16 19:34:06,444 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-11-16 19:34:06,444 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-11-16 19:34:06,444 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-11-16 19:34:06,444 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-11-16 19:34:06,445 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-11-16 19:34:06,445 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-16 19:34:06,445 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-11-16 19:34:06,445 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-11-16 19:34:06,445 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-11-16 19:34:06,446 INFO L895 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (exists ((|v_skolemized_q#valueAsBitvector_54| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_54|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_54|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_54|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_atan2_~hx~1#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_54|)))) (exists ((|v_skolemized_q#valueAsBitvector_66| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_66|)))) (and (not (= (_ bv0 32) (bvlshr (bvadd (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_66|) (_ bv2147483647 32)) (_ bv2148532224 32)) (_ bv31 32)))) (fp.gt .cse0 (_ +zero 11 53)) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0)))) (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7|))) (let ((.cse1 (select .cse3 (_ bv4 32))) (.cse2 (select .cse3 (_ bv0 32)))) (and (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand .cse1 (_ bv2147483647 32))) (= |ULTIMATE.start___ieee754_atan2_~lx~0#1| .cse2) (= .cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_35|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))))) (= currentRoundingMode roundNearestTiesToEven)) [2022-11-16 19:34:06,446 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-11-16 19:34:06,446 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-11-16 19:34:06,446 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-16 19:34:06,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 19:34:06,447 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-11-16 19:34:06,447 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-11-16 19:34:06,447 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-11-16 19:34:06,447 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-11-16 19:34:06,448 INFO L895 garLoopResultBuilder]: At program point L258(lines 247 259) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-11-16 19:34:06,448 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-11-16 19:34:06,448 INFO L902 garLoopResultBuilder]: At program point L292(lines 271 293) the Hoare annotation is: true [2022-11-16 19:34:06,448 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-11-16 19:34:06,449 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-11-16 19:34:06,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 19:34:06,449 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-16 19:34:06,449 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.add roundNearestTiesToEven ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-11-16 19:34:06,449 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-11-16 19:34:06,450 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-11-16 19:34:06,450 INFO L899 garLoopResultBuilder]: For program point L263-1(lines 263 267) no Hoare annotation was computed. [2022-11-16 19:34:06,450 INFO L895 garLoopResultBuilder]: At program point L263-2(lines 263 267) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= |ULTIMATE.start_isfinite_double_~x#1| |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-11-16 19:34:06,450 INFO L899 garLoopResultBuilder]: For program point L263-3(lines 263 267) no Hoare annotation was computed. [2022-11-16 19:34:06,451 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 19:34:06,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 287) no Hoare annotation was computed. [2022-11-16 19:34:06,451 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-11-16 19:34:06,451 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-11-16 19:34:06,451 INFO L895 garLoopResultBuilder]: At program point L231-1(lines 224 237) the Hoare annotation is: false [2022-11-16 19:34:06,452 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-11-16 19:34:06,452 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-11-16 19:34:06,452 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 290) no Hoare annotation was computed. [2022-11-16 19:34:06,452 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-11-16 19:34:06,452 INFO L899 garLoopResultBuilder]: For program point L281-4(lines 281 290) no Hoare annotation was computed. [2022-11-16 19:34:06,453 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-11-16 19:34:06,453 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= |ULTIMATE.start___ieee754_atan2_~y#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|))) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (exists ((|v_skolemized_q#valueAsBitvector_66| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_66|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_66|)))) (and (not (= (_ bv0 32) (bvlshr (bvadd (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_66|) (_ bv2147483647 32)) (_ bv2148532224 32)) (_ bv31 32)))) (fp.gt .cse1 (_ +zero 11 53)) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse1)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-11-16 19:34:06,453 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-11-16 19:34:06,454 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-11-16 19:34:06,454 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-11-16 19:34:06,454 INFO L899 garLoopResultBuilder]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2022-11-16 19:34:06,454 INFO L895 garLoopResultBuilder]: At program point L249-2(lines 249 254) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-11-16 19:34:06,454 INFO L899 garLoopResultBuilder]: For program point L249-3(lines 249 254) no Hoare annotation was computed. [2022-11-16 19:34:06,455 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-11-16 19:34:06,455 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-11-16 19:34:06,460 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:06,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:34:06,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,487 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,487 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,487 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,487 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,488 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,488 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,488 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,488 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,499 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,499 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,499 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,499 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,522 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:34:06 BoogieIcfgContainer [2022-11-16 19:34:06,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:34:06,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:34:06,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:34:06,529 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:34:06,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:49" (3/4) ... [2022-11-16 19:34:06,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 19:34:06,540 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-11-16 19:34:06,540 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-11-16 19:34:06,550 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-11-16 19:34:06,551 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-16 19:34:06,552 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 19:34:06,553 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 19:34:06,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-11-16 19:34:06,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-11-16 19:34:06,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-11-16 19:34:06,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-11-16 19:34:06,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_66 : bv64 :: (!(0bv32 == ~bvlshr32(~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_66[63:32], 2147483647bv32), 2148532224bv32), 31bv32)) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]), ~Pluszero~LONGDOUBLE())) && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-11-16 19:34:06,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_54 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_54[63:63], v_skolemized_q#valueAsBitvector_54[62:52], v_skolemized_q#valueAsBitvector_54[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_54[63:32])) && (\exists v_skolemized_q#valueAsBitvector_66 : bv64 :: (!(0bv32 == ~bvlshr32(~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_66[63:32], 2147483647bv32), 2148532224bv32), 31bv32)) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]), ~Pluszero~LONGDOUBLE())) && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]))) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-11-16 19:34:06,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-11-16 19:34:06,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 19:34:06,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:34:06,630 INFO L158 Benchmark]: Toolchain (without parser) took 163832.46ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 50.6MB in the beginning and 45.0MB in the end (delta: 5.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,631 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:34:06,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.36ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 46.4MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.00ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 43.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,633 INFO L158 Benchmark]: Boogie Preprocessor took 78.66ms. Allocated memory is still 69.2MB. Free memory was 43.7MB in the beginning and 40.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,633 INFO L158 Benchmark]: RCFGBuilder took 25633.14ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 40.6MB in the beginning and 66.6MB in the end (delta: -26.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,636 INFO L158 Benchmark]: TraceAbstraction took 137344.77ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 51.3MB in the end (delta: 14.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,637 INFO L158 Benchmark]: Witness Printer took 101.25ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 45.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 19:34:06,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.36ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 46.4MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.00ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 43.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.66ms. Allocated memory is still 69.2MB. Free memory was 43.7MB in the beginning and 40.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 25633.14ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 40.6MB in the beginning and 66.6MB in the end (delta: -26.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 137344.77ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 51.3MB in the end (delta: 14.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 101.25ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 45.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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 - PositiveResult [Line: 287]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 137.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 55.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 50.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 7634 SdHoareTripleChecker+Invalid, 47.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 521 IncrementalHoareTripleChecker+Unchecked, 6160 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1474 mSDtfsCounter, 116 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 44.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=11, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 98 PreInvPairs, 106 NumberOfFragments, 410 HoareAnnotationTreeSize, 98 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 243 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 67.9s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 355 ConstructedInterpolants, 223 QuantifiedInterpolants, 5380 SizeOfPredicates, 115 NumberOfNonLiveVariables, 2536 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 149]: Loop Invariant [2022-11-16 19:34:06,688 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,690 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,690 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,690 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,690 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_66 : bv64 :: (!(0bv32 == ~bvlshr32(~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_66[63:32], 2147483647bv32), 2148532224bv32), 31bv32)) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]), ~Pluszero~LONGDOUBLE())) && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_54,QUANTIFIED] [2022-11-16 19:34:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_66,QUANTIFIED] [2022-11-16 19:34:06,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_54 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_54[63:63], v_skolemized_q#valueAsBitvector_54[62:52], v_skolemized_q#valueAsBitvector_54[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_54[63:32])) && (\exists v_skolemized_q#valueAsBitvector_66 : bv64 :: (!(0bv32 == ~bvlshr32(~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_66[63:32], 2147483647bv32), 2148532224bv32), 31bv32)) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]), ~Pluszero~LONGDOUBLE())) && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_66[63:63], v_skolemized_q#valueAsBitvector_66[62:52], v_skolemized_q#valueAsBitvector_66[51:0]))) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 261]: Loop Invariant [2022-11-16 19:34:06,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,711 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,711 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,711 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,711 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,711 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,712 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,712 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:34:06,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-11-16 19:34:06,714 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 144]: Loop Invariant [2022-11-16 19:34:06,715 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,715 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,717 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant [2022-11-16 19:34:06,718 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,718 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 263]: Loop Invariant [2022-11-16 19:34:06,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,721 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,722 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,724 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,724 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 247]: Loop Invariant [2022-11-16 19:34:06,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,726 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,726 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,726 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,726 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,732 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:34:06,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-16 19:34:06,962 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-16 19:34:07,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8580981c-ee6b-48b4-a6ef-decab893156d/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE