./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- 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:49:42,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:49:42,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:49:42,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:49:42,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:49:42,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:49:42,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:49:42,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:49:42,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:49:42,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:49:42,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:49:42,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:49:42,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:49:42,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:49:42,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:49:42,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:49:42,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:49:42,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:49:42,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:49:42,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:49:42,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:49:42,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:49:42,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:49:42,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:49:42,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:49:42,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:49:42,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:49:42,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:49:42,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:49:42,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:49:42,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:49:42,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:49:42,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:49:42,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:49:42,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:49:42,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:49:42,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:49:42,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:49:42,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:49:42,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:49:42,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:49:42,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 19:49:42,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:49:42,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:49:42,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:49:42,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:49:42,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:49:42,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:49:42,449 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:49:42,449 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:49:42,449 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:49:42,449 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:49:42,449 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:49:42,450 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:49:42,450 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:49:42,450 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:49:42,450 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:49:42,450 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:49:42,451 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:49:42,451 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:49:42,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:49:42,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:49:42,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:49:42,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:49:42,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:49:42,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:49:42,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:49:42,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:49:42,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:49:42,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:49:42,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:49:42,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:49:42,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:49:42,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:49:42,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:49:42,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:49:42,457 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:49:42,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:49:42,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:49:42,459 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:49:42,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:49:42,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:49:42,459 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:49:42,460 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_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-11-16 19:49:42,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:49:42,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:49:42,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:49:42,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:49:42,794 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:49:42,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-11-16 19:49:42,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/106ecc301/cce7a2496e524337b27a21b31a862f3d/FLAGa1791ef87 [2022-11-16 19:49:43,377 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:49:43,378 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-11-16 19:49:43,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/106ecc301/cce7a2496e524337b27a21b31a862f3d/FLAGa1791ef87 [2022-11-16 19:49:43,753 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/106ecc301/cce7a2496e524337b27a21b31a862f3d [2022-11-16 19:49:43,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:49:43,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:49:43,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:49:43,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:49:43,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:49:43,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:49:43" (1/1) ... [2022-11-16 19:49:43,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfaf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:43, skipping insertion in model container [2022-11-16 19:49:43,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:49:43" (1/1) ... [2022-11-16 19:49:43,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:49:43,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:49:44,107 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_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c[6875,6888] [2022-11-16 19:49:44,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:49:44,130 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:49:44,220 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_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c[6875,6888] [2022-11-16 19:49:44,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:49:44,241 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:49:44,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44 WrapperNode [2022-11-16 19:49:44,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:49:44,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:49:44,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:49:44,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:49:44,253 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:49:44" (1/1) ... [2022-11-16 19:49:44,266 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:49:44" (1/1) ... [2022-11-16 19:49:44,331 INFO L138 Inliner]: procedures = 21, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2022-11-16 19:49:44,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:49:44,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:49:44,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:49:44,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:49:44,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:49:44,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:49:44,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:49:44,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:49:44,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (1/1) ... [2022-11-16 19:49:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:49:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:49:44,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:49:44,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:49:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:49:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:49:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:49:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-16 19:49:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:49:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-11-16 19:49:44,492 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-11-16 19:49:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-16 19:49:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-11-16 19:49:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-11-16 19:49:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:49:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:49:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 19:49:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-16 19:49:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:49:44,621 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:49:44,623 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:49:45,390 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:49:45,543 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:49:45,544 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-16 19:49:45,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:49:45 BoogieIcfgContainer [2022-11-16 19:49:45,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:49:45,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:49:45,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:49:45,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:49:45,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:49:43" (1/3) ... [2022-11-16 19:49:45,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f28b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:49:45, skipping insertion in model container [2022-11-16 19:49:45,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:44" (2/3) ... [2022-11-16 19:49:45,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f28b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:49:45, skipping insertion in model container [2022-11-16 19:49:45,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:49:45" (3/3) ... [2022-11-16 19:49:45,558 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-11-16 19:49:45,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:49:45,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 19:49:45,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:49:45,688 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;@787d8a83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:49:45,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 19:49:45,692 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:49:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:49:45,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:49:45,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:49:45,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:49:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:49:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -298414451, now seen corresponding path program 1 times [2022-11-16 19:49:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:49:45,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307965129] [2022-11-16 19:49:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:49:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:49:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:49:46,042 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:49:46,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:49:46,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307965129] [2022-11-16 19:49:46,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307965129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:49:46,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:49:46,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:49:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879288809] [2022-11-16 19:49:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:49:46,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:49:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:49:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:49:46,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:49:46,138 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:49:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:49:46,249 INFO L93 Difference]: Finished difference Result 157 states and 261 transitions. [2022-11-16 19:49:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:49:46,252 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:49:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:49:46,261 INFO L225 Difference]: With dead ends: 157 [2022-11-16 19:49:46,261 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 19:49:46,265 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:49:46,269 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:49:46,270 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:49:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 19:49:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 19:49:46,315 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:49:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-16 19:49:46,319 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 13 [2022-11-16 19:49:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:49:46,319 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-16 19:49:46,320 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:49:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-16 19:49:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:49:46,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:49:46,321 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:49:46,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:49:46,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:49:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:49:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1894147791, now seen corresponding path program 1 times [2022-11-16 19:49:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:49:46,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860841054] [2022-11-16 19:49:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:49:46,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:49:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:49:46,553 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:49:46,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:49:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860841054] [2022-11-16 19:49:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860841054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:49:46,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:49:46,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:49:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653396847] [2022-11-16 19:49:46,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:49:46,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:49:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:49:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:49:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:49:46,559 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:49:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:49:46,685 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2022-11-16 19:49:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:49:46,686 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:49:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:49:46,688 INFO L225 Difference]: With dead ends: 144 [2022-11-16 19:49:46,688 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 19:49:46,689 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:49:46,694 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:49:46,694 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:49:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 19:49:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 19:49:46,702 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:49:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2022-11-16 19:49:46,703 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 16 [2022-11-16 19:49:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:49:46,704 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2022-11-16 19:49:46,704 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:49:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2022-11-16 19:49:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 19:49:46,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:49:46,705 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:49:46,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:49:46,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:49:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:49:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash -577975455, now seen corresponding path program 1 times [2022-11-16 19:49:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:49:46,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380737863] [2022-11-16 19:49:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:49:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:49:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:49:47,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:49:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:49:47,756 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 19:49:47,757 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:49:47,758 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 19:49:47,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:49:47,764 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 19:49:47,767 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:49:47,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:49:47 BoogieIcfgContainer [2022-11-16 19:49:47,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:49:47,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:49:47,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:49:47,834 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:49:47,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:49:45" (3/4) ... [2022-11-16 19:49:47,838 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 19:49:47,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:49:47,840 INFO L158 Benchmark]: Toolchain (without parser) took 4082.25ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 77.4MB in the beginning and 111.5MB in the end (delta: -34.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,840 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 92.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:49:47,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.75ms. Allocated memory is still 104.9MB. Free memory was 77.4MB in the beginning and 62.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.81ms. Allocated memory is still 104.9MB. Free memory was 62.7MB in the beginning and 59.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,852 INFO L158 Benchmark]: Boogie Preprocessor took 46.83ms. Allocated memory is still 104.9MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,852 INFO L158 Benchmark]: RCFGBuilder took 1165.74ms. Allocated memory is still 104.9MB. Free memory was 55.8MB in the beginning and 56.9MB in the end (delta: -1.2MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,854 INFO L158 Benchmark]: TraceAbstraction took 2282.43ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 56.0MB in the beginning and 111.5MB in the end (delta: -55.5MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-11-16 19:49:47,855 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 144.7MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:49:47,858 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.28ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 92.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.75ms. Allocated memory is still 104.9MB. Free memory was 77.4MB in the beginning and 62.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.81ms. Allocated memory is still 104.9MB. Free memory was 62.7MB in the beginning and 59.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.83ms. Allocated memory is still 104.9MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.74ms. Allocated memory is still 104.9MB. Free memory was 55.8MB in the beginning and 56.9MB in the end (delta: -1.2MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2282.43ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 56.0MB in the beginning and 111.5MB in the end (delta: -55.5MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 5.63ms. Allocated memory is still 144.7MB. Free memory is still 111.5MB. 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: 2.1s, 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.8s 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:49:47,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- 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:49:50,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:49:50,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:49:50,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:49:50,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:49:50,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:49:50,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:49:50,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:49:50,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:49:50,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:49:50,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:49:50,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:49:50,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:49:50,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:49:50,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:49:50,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:49:50,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:49:50,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:49:50,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:49:50,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:49:50,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:49:50,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:49:50,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:49:50,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:49:50,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:49:50,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:49:50,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:49:50,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:49:50,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:49:50,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:49:50,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:49:50,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:49:50,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:49:50,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:49:50,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:49:50,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:49:50,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:49:50,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:49:50,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:49:50,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:49:50,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:49:50,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-16 19:49:50,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:49:50,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:49:50,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:49:50,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:49:50,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:49:50,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:49:50,583 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:49:50,584 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:49:50,584 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:49:50,584 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:49:50,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:49:50,585 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:49:50,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:49:50,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:49:50,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:49:50,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:49:50,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:49:50,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:49:50,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:49:50,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:49:50,589 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 19:49:50,589 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 19:49:50,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:49:50,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:49:50,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:49:50,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:49:50,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:49:50,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 19:49:50,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:49:50,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:49:50,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:49:50,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:49:50,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:49:50,592 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 19:49:50,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 19:49:50,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:49:50,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:49:50,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 19:49:50,594 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_5dcb99ab-306a-495d-8338-b6177a246439/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_5dcb99ab-306a-495d-8338-b6177a246439/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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-11-16 19:49:51,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:49:51,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:49:51,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:49:51,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:49:51,068 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:49:51,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-11-16 19:49:51,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/f0996e6a1/e6028da960e24914865caae9199891f5/FLAG09c37e5cd [2022-11-16 19:49:51,734 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:49:51,735 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-11-16 19:49:51,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/f0996e6a1/e6028da960e24914865caae9199891f5/FLAG09c37e5cd [2022-11-16 19:49:52,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/data/f0996e6a1/e6028da960e24914865caae9199891f5 [2022-11-16 19:49:52,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:49:52,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:49:52,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:49:52,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:49:52,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:49:52,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bee0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52, skipping insertion in model container [2022-11-16 19:49:52,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:49:52,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:49:52,350 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_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c[6875,6888] [2022-11-16 19:49:52,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:49:52,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:49:52,455 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_5dcb99ab-306a-495d-8338-b6177a246439/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c[6875,6888] [2022-11-16 19:49:52,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:49:52,509 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:49:52,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52 WrapperNode [2022-11-16 19:49:52,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:49:52,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:49:52,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:49:52,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:49:52,522 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:49:52" (1/1) ... [2022-11-16 19:49:52,542 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:49:52" (1/1) ... [2022-11-16 19:49:52,577 INFO L138 Inliner]: procedures = 24, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 268 [2022-11-16 19:49:52,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:49:52,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:49:52,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:49:52,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:49:52,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:49:52,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:49:52,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:49:52,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:49:52,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (1/1) ... [2022-11-16 19:49:52,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:49:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:49:52,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:49:52,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:49:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:49:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-16 19:49:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-11-16 19:49:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 19:49:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:49:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-11-16 19:49:52,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-11-16 19:49:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-11-16 19:49:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-11-16 19:49:52,730 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-11-16 19:49:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 19:49:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:49:52,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:49:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 19:49:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:49:52,906 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:49:52,909 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:50:20,835 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:50:20,845 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:50:20,846 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-16 19:50:20,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:50:20 BoogieIcfgContainer [2022-11-16 19:50:20,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:50:20,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:50:20,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:50:20,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:50:20,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:49:52" (1/3) ... [2022-11-16 19:50:20,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff1de05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:20, skipping insertion in model container [2022-11-16 19:50:20,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:49:52" (2/3) ... [2022-11-16 19:50:20,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff1de05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:20, skipping insertion in model container [2022-11-16 19:50:20,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:50:20" (3/3) ... [2022-11-16 19:50:20,861 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-11-16 19:50:20,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:50:20,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 19:50:20,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:50:20,970 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;@ff808de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:50:20,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 19:50:20,975 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:50:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:50:20,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:20,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:50:20,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1890267110, now seen corresponding path program 1 times [2022-11-16 19:50:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:21,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879728694] [2022-11-16 19:50:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:21,007 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:50:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:21,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:21,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:21,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 19:50:21,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:21,571 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:50:21,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:21,572 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:21,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879728694] [2022-11-16 19:50:21,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879728694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:21,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:21,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:50:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736053828] [2022-11-16 19:50:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:50:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:21,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:50:21,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:50:21,622 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:50:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:21,672 INFO L93 Difference]: Finished difference Result 192 states and 314 transitions. [2022-11-16 19:50:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:50:21,674 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:50:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:21,683 INFO L225 Difference]: With dead ends: 192 [2022-11-16 19:50:21,683 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:50:21,687 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:50:21,691 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:50:21,692 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:50:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:50:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:50:21,733 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:50:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2022-11-16 19:50:21,737 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 15 [2022-11-16 19:50:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:21,737 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2022-11-16 19:50:21,738 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:50:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2022-11-16 19:50:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 19:50:21,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:21,739 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:50:21,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:21,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:21,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1206213533, now seen corresponding path program 1 times [2022-11-16 19:50:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029363021] [2022-11-16 19:50:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:21,961 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:50:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:21,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:21,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:22,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 19:50:22,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:22,608 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:50:22,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:22,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029363021] [2022-11-16 19:50:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029363021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:22,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:22,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:50:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567662909] [2022-11-16 19:50:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:22,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:50:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:50:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:50:22,613 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:50:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:22,930 INFO L93 Difference]: Finished difference Result 175 states and 248 transitions. [2022-11-16 19:50:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:50:22,932 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:50:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:22,936 INFO L225 Difference]: With dead ends: 175 [2022-11-16 19:50:22,939 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:50:22,940 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:50:22,942 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:50:22,942 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.3s Time] [2022-11-16 19:50:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:50:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:50:22,950 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:50:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2022-11-16 19:50:22,953 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 18 [2022-11-16 19:50:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:22,953 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2022-11-16 19:50:22,953 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:50:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-11-16 19:50:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 19:50:22,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:22,955 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:50:22,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:23,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:23,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1202351854, now seen corresponding path program 1 times [2022-11-16 19:50:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107591398] [2022-11-16 19:50:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:23,167 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:50:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:23,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:23,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:23,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-16 19:50:23,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:24,608 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:50:27,499 INFO L321 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-11-16 19:50:27,500 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:50:32,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:50:32,473 INFO L321 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-11-16 19:50:32,474 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:50:35,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:50:35,213 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:50:39,226 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:50:39,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:39,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107591398] [2022-11-16 19:50:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107591398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:39,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:39,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:50:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830548063] [2022-11-16 19:50:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:39,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 19:50:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 19:50:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-16 19:50:39,229 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:50:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:39,268 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-11-16 19:50:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:50:39,269 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:50:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:39,270 INFO L225 Difference]: With dead ends: 97 [2022-11-16 19:50:39,270 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:50:39,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-16 19:50:39,272 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:50:39,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1268 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 149 Unchecked, 0.0s Time] [2022-11-16 19:50:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:50:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:50:39,282 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:50:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2022-11-16 19:50:39,283 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 22 [2022-11-16 19:50:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:39,284 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2022-11-16 19:50:39,284 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:50:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2022-11-16 19:50:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 19:50:39,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:39,286 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:50:39,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:39,511 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 628413096, now seen corresponding path program 1 times [2022-11-16 19:50:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:39,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148814440] [2022-11-16 19:50:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:39,513 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:50:39,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:39,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:39,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:40,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 19:50:40,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:42,021 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:50:42,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:42,022 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148814440] [2022-11-16 19:50:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148814440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:50:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689856376] [2022-11-16 19:50:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:42,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:50:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:50:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:50:42,025 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:50:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:42,041 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2022-11-16 19:50:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:50:42,041 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:50:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:42,043 INFO L225 Difference]: With dead ends: 101 [2022-11-16 19:50:42,043 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:50:42,044 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:50:42,045 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:50:42,046 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:50:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:50:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:50:42,058 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:50:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2022-11-16 19:50:42,060 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 25 [2022-11-16 19:50:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:42,061 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2022-11-16 19:50:42,061 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:50:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2022-11-16 19:50:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:50:42,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:42,063 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:50:42,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:42,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:42,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1693886686, now seen corresponding path program 1 times [2022-11-16 19:50:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:42,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441341447] [2022-11-16 19:50:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:42,280 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:50:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:42,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:42,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:42,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 19:50:42,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:44,983 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:50:44,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:44,983 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441341447] [2022-11-16 19:50:44,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441341447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:44,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:44,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:50:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252393279] [2022-11-16 19:50:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:50:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:50:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:50:44,986 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:50:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:45,002 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2022-11-16 19:50:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:50:45,003 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:50:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:45,005 INFO L225 Difference]: With dead ends: 148 [2022-11-16 19:50:45,005 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:50:45,006 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:50:45,007 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:50:45,007 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:50:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:50:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:50:45,018 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:50:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2022-11-16 19:50:45,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 27 [2022-11-16 19:50:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:45,020 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-11-16 19:50:45,021 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:50:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2022-11-16 19:50:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:50:45,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:45,022 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:50:45,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:45,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 151539556, now seen corresponding path program 1 times [2022-11-16 19:50:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:45,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954110610] [2022-11-16 19:50:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:45,241 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:50:45,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:45,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:45,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:45,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 19:50:45,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:48,914 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:50:48,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:48,915 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954110610] [2022-11-16 19:50:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954110610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:48,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:48,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:50:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923816530] [2022-11-16 19:50:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:48,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:50:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:50:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:50:48,918 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:50:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:49,477 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2022-11-16 19:50:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:50:49,478 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:50:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:49,479 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:50:49,480 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:50:49,480 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:50:49,481 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:50:49,482 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.5s Time] [2022-11-16 19:50:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:50:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-11-16 19:50:49,510 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:50:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2022-11-16 19:50:49,512 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 27 [2022-11-16 19:50:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:49,513 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2022-11-16 19:50:49,513 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:50:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2022-11-16 19:50:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:50:49,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:49,525 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:50:49,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:49,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:49,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 94281254, now seen corresponding path program 1 times [2022-11-16 19:50:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87137648] [2022-11-16 19:50:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:49,728 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:50:49,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:49,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:49,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:50,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:50:50,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:52,671 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:50:52,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:52,672 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:52,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87137648] [2022-11-16 19:50:52,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87137648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:52,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:52,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:50:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640127075] [2022-11-16 19:50:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:52,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:50:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:50:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:50:52,688 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:50:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:50:53,301 INFO L93 Difference]: Finished difference Result 165 states and 227 transitions. [2022-11-16 19:50:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:50:53,302 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:50:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:50:53,303 INFO L225 Difference]: With dead ends: 165 [2022-11-16 19:50:53,303 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 19:50:53,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:50:53,305 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:50:53,305 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.6s Time] [2022-11-16 19:50:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 19:50:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-11-16 19:50:53,315 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:50:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2022-11-16 19:50:53,316 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 27 [2022-11-16 19:50:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:50:53,317 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2022-11-16 19:50:53,317 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:50:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2022-11-16 19:50:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:50:53,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:50:53,319 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:50:53,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:53,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:50:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:50:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1782996585, now seen corresponding path program 1 times [2022-11-16 19:50:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:50:53,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683410536] [2022-11-16 19:50:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:50:53,540 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:50:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:50:53,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:53,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:50:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:50:54,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:50:54,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:50:56,680 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:50:56,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:50:56,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:50:56,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683410536] [2022-11-16 19:50:56,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683410536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:50:56,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:50:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:50:56,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702364015] [2022-11-16 19:50:56,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:50:56,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:50:56,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:50:56,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:50:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:50:56,683 INFO L87 Difference]: Start difference. First operand 93 states and 124 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:50:58,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:50:59,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:51:00,064 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-11-16 19:51:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:51:00,073 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:51:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:51:00,074 INFO L225 Difference]: With dead ends: 101 [2022-11-16 19:51:00,074 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:51:00,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:51:00,076 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:51:00,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 26 Unchecked, 3.4s Time] [2022-11-16 19:51:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:51:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-16 19:51:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 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:51:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 129 transitions. [2022-11-16 19:51:00,088 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 129 transitions. Word has length 28 [2022-11-16 19:51:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:51:00,089 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 129 transitions. [2022-11-16 19:51:00,089 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:51:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 129 transitions. [2022-11-16 19:51:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:51:00,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:51:00,091 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:51:00,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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)] Ended with exit code 0 [2022-11-16 19:51:00,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:00,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:51:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:51:00,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1805876073, now seen corresponding path program 1 times [2022-11-16 19:51:00,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:51:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059537644] [2022-11-16 19:51:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:51:00,301 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:51:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:51:00,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:00,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:51:00,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:51:00,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:51:03,484 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:51:03,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:51:03,484 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:51:03,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059537644] [2022-11-16 19:51:03,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059537644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:51:03,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:51:03,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:51:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117551667] [2022-11-16 19:51:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:51:03,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:51:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:51:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:51:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:51:03,486 INFO L87 Difference]: Start difference. First operand 97 states and 129 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:51:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:51:04,305 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2022-11-16 19:51:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:51:04,306 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:51:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:51:04,307 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:51:04,307 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:51:04,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:51:04,308 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 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.8s IncrementalHoareTripleChecker+Time [2022-11-16 19:51:04,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 27 Unchecked, 0.8s Time] [2022-11-16 19:51:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:51:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 19:51:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 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:51:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2022-11-16 19:51:04,318 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 28 [2022-11-16 19:51:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:51:04,318 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2022-11-16 19:51:04,318 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:51:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2022-11-16 19:51:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:51:04,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:51:04,320 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:51:04,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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)] Forceful destruction successful, exit code 0 [2022-11-16 19:51:04,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:04,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:51:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:51:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 400402884, now seen corresponding path program 1 times [2022-11-16 19:51:04,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:51:04,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896796424] [2022-11-16 19:51:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:51:04,536 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:51:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:51:04,537 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:04,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:51:04,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 19:51:04,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:51:05,874 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:51:06,647 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:51:12,071 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:51:12,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:51:12,071 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:51:12,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896796424] [2022-11-16 19:51:12,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896796424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:51:12,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:51:12,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 19:51:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673504436] [2022-11-16 19:51:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:51:12,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:51:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:51:12,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:51:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:51:12,073 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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:51:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:51:12,268 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2022-11-16 19:51:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:51:12,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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:51:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:51:12,270 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:51:12,270 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:51:12,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:51:12,271 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:51:12,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 813 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2022-11-16 19:51:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:51:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 19:51:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 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:51:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2022-11-16 19:51:12,279 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 28 [2022-11-16 19:51:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:51:12,280 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2022-11-16 19:51:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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:51:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2022-11-16 19:51:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:51:12,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:51:12,281 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:51:12,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:12,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:51:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:51:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -563113248, now seen corresponding path program 1 times [2022-11-16 19:51:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:51:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001595024] [2022-11-16 19:51:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:51:12,498 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:51:12,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:51:12,499 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:12,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:51:12,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 19:51:12,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:51:15,968 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:51:15,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:51:15,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:51:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001595024] [2022-11-16 19:51:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001595024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:51:15,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:51:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:51:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285144925] [2022-11-16 19:51:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:51:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:51:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:51:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:51:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:51:15,971 INFO L87 Difference]: Start difference. First operand 98 states and 129 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:51:17,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:51:18,275 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2022-11-16 19:51:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:51:18,287 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:51:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:51:18,287 INFO L225 Difference]: With dead ends: 103 [2022-11-16 19:51:18,288 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 19:51:18,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:51:18,288 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:51:18,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 44 Unchecked, 2.3s Time] [2022-11-16 19:51:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 19:51:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-16 19:51:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 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:51:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2022-11-16 19:51:18,296 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 29 [2022-11-16 19:51:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:51:18,296 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2022-11-16 19:51:18,297 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:51:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2022-11-16 19:51:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:51:18,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:51:18,298 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:51:18,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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)] Ended with exit code 0 [2022-11-16 19:51:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:18,519 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:51:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:51:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 146865864, now seen corresponding path program 1 times [2022-11-16 19:51:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:51:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495069380] [2022-11-16 19:51:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:51:18,520 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:51:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:51:18,521 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:18,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:51:18,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 19:51:18,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:51:22,098 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:51:22,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:51:22,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:51:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495069380] [2022-11-16 19:51:22,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495069380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:51:22,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:51:22,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:51:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502759135] [2022-11-16 19:51:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:51:22,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:51:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:51:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:51:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:51:22,101 INFO L87 Difference]: Start difference. First operand 99 states and 130 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:51:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:51:23,003 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-11-16 19:51:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:51:23,004 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:51:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:51:23,005 INFO L225 Difference]: With dead ends: 104 [2022-11-16 19:51:23,005 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 19:51:23,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:51:23,006 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 19:51:23,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 26 Unchecked, 0.9s Time] [2022-11-16 19:51:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 19:51:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-16 19:51:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 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:51:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-11-16 19:51:23,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 29 [2022-11-16 19:51:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:51:23,018 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-11-16 19:51:23,018 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:51:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-11-16 19:51:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:51:23,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:51:23,019 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:51:23,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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)] Ended with exit code 0 [2022-11-16 19:51:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:23,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:51:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:51:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -474619585, now seen corresponding path program 1 times [2022-11-16 19:51:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:51:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906116705] [2022-11-16 19:51:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:51:23,232 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:51:23,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:51:23,232 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:23,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:51:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:51:23,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 19:51:23,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:51:28,304 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:51:28,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:51:28,305 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:51:28,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906116705] [2022-11-16 19:51:28,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906116705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:51:28,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:51:28,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:51:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825953274] [2022-11-16 19:51:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:51:28,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:51:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:51:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:51:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:51:28,307 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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:51:31,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:34,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s 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:51:42,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:46,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:48,354 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:51:50,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:54,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:56,266 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:51:58,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:51:59,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:01,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:04,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:07,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:11,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:14,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:17,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:20,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:22,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:24,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 19:52:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:52:24,193 INFO L93 Difference]: Finished difference Result 122 states and 156 transitions. [2022-11-16 19:52:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:52:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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:52:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:52:24,196 INFO L225 Difference]: With dead ends: 122 [2022-11-16 19:52:24,196 INFO L226 Difference]: Without dead ends: 118 [2022-11-16 19:52:24,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:52:24,198 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:52:24,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 328 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 53.1s Time] [2022-11-16 19:52:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-16 19:52:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-11-16 19:52:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 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:52:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2022-11-16 19:52:24,209 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 29 [2022-11-16 19:52:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:52:24,209 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2022-11-16 19:52:24,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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:52:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-11-16 19:52:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 19:52:24,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:52:24,210 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] [2022-11-16 19:52:24,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:24,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:24,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:52:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:52:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -277925084, now seen corresponding path program 1 times [2022-11-16 19:52:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:52:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933396163] [2022-11-16 19:52:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:52:24,419 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:52:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:52:24,420 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:24,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:52:25,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 19:52:25,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:52:36,026 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:52:36,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:52:36,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:52:36,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933396163] [2022-11-16 19:52:36,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933396163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:52:36,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:52:36,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 19:52:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116625445] [2022-11-16 19:52:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:52:36,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 19:52:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:52:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 19:52:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2022-11-16 19:52:36,030 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:52:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:52:36,434 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-11-16 19:52:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:52:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-11-16 19:52:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:52:36,435 INFO L225 Difference]: With dead ends: 158 [2022-11-16 19:52:36,435 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 19:52:36,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2022-11-16 19:52:36,437 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 7 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:52:36,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 882 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-16 19:52:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 19:52:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2022-11-16 19:52:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 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:52:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2022-11-16 19:52:36,445 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 30 [2022-11-16 19:52:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:52:36,446 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2022-11-16 19:52:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:52:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-11-16 19:52:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 19:52:36,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:52:36,447 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] [2022-11-16 19:52:36,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:36,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:36,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:52:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:52:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 257305892, now seen corresponding path program 1 times [2022-11-16 19:52:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:52:36,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677205792] [2022-11-16 19:52:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:52:36,663 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:52:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:52:36,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:36,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (16)] Waiting until timeout for monitored process [2022-11-16 19:52:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:52:37,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 19:52:37,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:52:38,148 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:52:39,089 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:52:45,521 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:52:45,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:52:45,521 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:52:45,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677205792] [2022-11-16 19:52:45,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677205792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:52:45,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:52:45,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 19:52:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436042495] [2022-11-16 19:52:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:52:45,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:52:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:52:45,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:52:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:52:45,523 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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:52:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:52:46,211 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2022-11-16 19:52:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:52:46,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2022-11-16 19:52:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:52:46,223 INFO L225 Difference]: With dead ends: 103 [2022-11-16 19:52:46,223 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 19:52:46,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:52:46,224 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 19:52:46,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2022-11-16 19:52:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 19:52:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-16 19:52:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 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:52:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2022-11-16 19:52:46,236 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 30 [2022-11-16 19:52:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:52:46,236 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2022-11-16 19:52:46,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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:52:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2022-11-16 19:52:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 19:52:46,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:52:46,238 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] [2022-11-16 19:52:46,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (16)] Forceful destruction successful, exit code 0 [2022-11-16 19:52:46,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:46,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:52:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:52:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1531323558, now seen corresponding path program 1 times [2022-11-16 19:52:46,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:52:46,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139544090] [2022-11-16 19:52:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:52:46,448 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:52:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:52:46,449 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:46,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (17)] Waiting until timeout for monitored process [2022-11-16 19:52:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:52:46,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 19:52:46,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:52:50,665 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:52:50,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:52:50,665 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:52:50,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139544090] [2022-11-16 19:52:50,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139544090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:52:50,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:52:50,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:52:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910247535] [2022-11-16 19:52:50,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:52:50,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:52:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:52:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:52:50,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:52:50,668 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:52:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:52:50,756 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2022-11-16 19:52:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:52:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 33 [2022-11-16 19:52:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:52:50,758 INFO L225 Difference]: With dead ends: 156 [2022-11-16 19:52:50,758 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:52:50,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:52:50,759 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:52:50,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 650 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-11-16 19:52:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:52:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:52:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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:52:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2022-11-16 19:52:50,769 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 33 [2022-11-16 19:52:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:52:50,769 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2022-11-16 19:52:50,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:52:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-11-16 19:52:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 19:52:50,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:52:50,771 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:52:50,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (17)] Forceful destruction successful, exit code 0 [2022-11-16 19:52:50,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:50,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:52:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:52:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 819116375, now seen corresponding path program 1 times [2022-11-16 19:52:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:52:50,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658477770] [2022-11-16 19:52:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:52:50,996 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:52:50,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:52:50,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:50,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (18)] Waiting until timeout for monitored process [2022-11-16 19:52:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:52:51,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 19:52:51,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:52:53,099 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:52:53,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:52:53,100 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:52:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658477770] [2022-11-16 19:52:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658477770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:52:53,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:52:53,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:52:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680882513] [2022-11-16 19:52:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:52:53,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:52:53,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:52:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:52:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:52:53,103 INFO L87 Difference]: Start difference. First operand 93 states and 120 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:52:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:52:53,112 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2022-11-16 19:52:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:52:53,112 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:52:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:52:53,113 INFO L225 Difference]: With dead ends: 127 [2022-11-16 19:52:53,113 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 19:52:53,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:52:53,114 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:52:53,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-11-16 19:52:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 19:52:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-16 19:52:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 19:52:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-11-16 19:52:53,123 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 35 [2022-11-16 19:52:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:52:53,123 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-11-16 19:52:53,123 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:52:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-11-16 19:52:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 19:52:53,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:52:53,124 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] [2022-11-16 19:52:53,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (18)] Forceful destruction successful, exit code 0 [2022-11-16 19:52:53,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:53,346 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 19:52:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:52:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash 352853530, now seen corresponding path program 1 times [2022-11-16 19:52:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 19:52:53,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791349932] [2022-11-16 19:52:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:52:53,347 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:52:53,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 19:52:53,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:52:53,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (19)] Waiting until timeout for monitored process [2022-11-16 19:52:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:52:53,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 19:52:53,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:52:54,942 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:52:55,882 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:53:01,898 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:53:01,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:53:01,898 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 19:53:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791349932] [2022-11-16 19:53:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791349932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:53:01,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:53:01,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 19:53:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063187720] [2022-11-16 19:53:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:53:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:53:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 19:53:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:53:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-11-16 19:53:01,900 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:53:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:53:01,907 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2022-11-16 19:53:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:53:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 34 [2022-11-16 19:53:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:53:01,908 INFO L225 Difference]: With dead ends: 91 [2022-11-16 19:53:01,908 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 19:53:01,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-11-16 19:53:01,909 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:53:01,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-11-16 19:53:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 19:53:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 19:53:01,911 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:53:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 19:53:01,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-11-16 19:53:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:53:01,912 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 19:53:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:53:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 19:53:01,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 19:53:01,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 19:53:01,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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 (19)] Forceful destruction successful, exit code 0 [2022-11-16 19:53:02,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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:53:02,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 19:53:08,871 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-11-16 19:53:08,871 INFO L902 garLoopResultBuilder]: At program point L26-1(lines 19 33) the Hoare annotation is: true [2022-11-16 19:53:08,872 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-11-16 19:53:08,872 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-11-16 19:53:08,872 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-11-16 19:53:08,872 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-11-16 19:53:08,872 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-11-16 19:53:08,873 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-11-16 19:53:08,873 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-11-16 19:53:08,873 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-16 19:53:08,873 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-11-16 19:53:08,873 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-11-16 19:53:08,874 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-11-16 19:53:08,874 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-11-16 19:53:08,874 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-11-16 19:53:08,874 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-11-16 19:53:08,874 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-11-16 19:53:08,874 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-11-16 19:53:08,875 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-11-16 19:53:08,875 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-11-16 19:53:08,875 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-11-16 19:53:08,875 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-11-16 19:53:08,875 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-11-16 19:53:08,876 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-11-16 19:53:08,876 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-11-16 19:53:08,876 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-11-16 19:53:08,876 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-11-16 19:53:08,876 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-11-16 19:53:08,876 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-11-16 19:53:08,877 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-11-16 19:53:08,877 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-11-16 19:53:08,877 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-11-16 19:53:08,877 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-11-16 19:53:08,877 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 19:53:08,878 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-11-16 19:53:08,878 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-11-16 19:53:08,878 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:53:08,879 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-11-16 19:53:08,879 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-11-16 19:53:08,879 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-11-16 19:53:08,879 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-11-16 19:53:08,879 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 289) no Hoare annotation was computed. [2022-11-16 19:53:08,880 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-11-16 19:53:08,880 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-11-16 19:53:08,880 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-11-16 19:53:08,880 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-11-16 19:53:08,880 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-16 19:53:08,881 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-11-16 19:53:08,882 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-11-16 19:53:08,882 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-11-16 19:53:08,882 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) (exists ((|v_skolemized_q#valueAsBitvector_102| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_102|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_102|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_102|)))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (not (= (bvlshr (bvadd (_ bv2148532224 32) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_102|))) (_ bv31 32)) (_ bv0 32))) (fp.lt .cse0 (_ +zero 11 53))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (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) (exists ((|v_skolemized_q#valueAsBitvector_85| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_85|)) (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_85|))))) [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-11-16 19:53:08,883 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-11-16 19:53:08,884 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-11-16 19:53:08,884 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-11-16 19:53:08,884 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:53:08,884 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-11-16 19:53:08,885 INFO L902 garLoopResultBuilder]: At program point L292(lines 271 293) the Hoare annotation is: true [2022-11-16 19:53:08,885 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-11-16 19:53:08,885 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-11-16 19:53:08,885 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 19:53:08,885 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-16 19:53:08,886 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.sub roundNearestTiesToEven (fp.neg ~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:53:08,886 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-11-16 19:53:08,886 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-11-16 19:53:08,886 INFO L899 garLoopResultBuilder]: For program point L263-1(lines 263 267) no Hoare annotation was computed. [2022-11-16 19:53:08,886 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:53:08,887 INFO L899 garLoopResultBuilder]: For program point L263-3(lines 263 267) no Hoare annotation was computed. [2022-11-16 19:53:08,887 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 19:53:08,887 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 287) no Hoare annotation was computed. [2022-11-16 19:53:08,887 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-11-16 19:53:08,887 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-11-16 19:53:08,888 INFO L895 garLoopResultBuilder]: At program point L231-1(lines 224 237) the Hoare annotation is: false [2022-11-16 19:53:08,888 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-11-16 19:53:08,888 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-11-16 19:53:08,888 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 290) no Hoare annotation was computed. [2022-11-16 19:53:08,888 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-11-16 19:53:08,888 INFO L899 garLoopResultBuilder]: For program point L281-4(lines 281 290) no Hoare annotation was computed. [2022-11-16 19:53:08,889 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-11-16 19:53:08,889 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_102| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_102|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_102|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_102|)))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (not (= (bvlshr (bvadd (_ bv2148532224 32) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_102|))) (_ bv31 32)) (_ bv0 32))) (fp.lt .cse0 (_ +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 ((.cse1 (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|) .cse1) (= |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) .cse1) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-11-16 19:53:08,889 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-11-16 19:53:08,889 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-11-16 19:53:08,890 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-11-16 19:53:08,890 INFO L899 garLoopResultBuilder]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2022-11-16 19:53:08,890 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:53:08,890 INFO L899 garLoopResultBuilder]: For program point L249-3(lines 249 254) no Hoare annotation was computed. [2022-11-16 19:53:08,890 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-11-16 19:53:08,891 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-11-16 19:53:08,894 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:53:08,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:53:08,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,908 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:53:08,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,909 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:53:08,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,920 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:53:08,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,921 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:53:08,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,923 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,925 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:53:08,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,925 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:53:08,925 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:53:08,926 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:53:08,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:08,931 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:53:08,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,931 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:53:08,931 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:53:08,931 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:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:08,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,935 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:53:08,936 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,936 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,936 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,936 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:53:08,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,937 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,937 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,938 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:53:08,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:08,939 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:53:08,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,941 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,941 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,941 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,944 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:53:08,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,946 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:53:08,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,947 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,948 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,948 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:53:08,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,949 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,950 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:53:08,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:08,968 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:08,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:08,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:53:08 BoogieIcfgContainer [2022-11-16 19:53:08,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:53:08,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:53:08,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:53:08,971 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:53:08,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:50:20" (3/4) ... [2022-11-16 19:53:08,975 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 19:53:08,982 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-11-16 19:53:08,982 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-11-16 19:53:08,994 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-11-16 19:53:08,995 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-16 19:53:08,995 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 19:53:08,996 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 19:53:09,024 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:53:09,026 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:53:09,026 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:53:09,027 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:53:09,028 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_102 : bv64 :: (y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_102[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51: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) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-11-16 19:53:09,028 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_102 : bv64 :: (y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_102[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]), ~Pluszero~LONGDOUBLE()))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\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) && (\exists v_skolemized_q#valueAsBitvector_85 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_85[63:63], v_skolemized_q#valueAsBitvector_85[62:52], v_skolemized_q#valueAsBitvector_85[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_85[63:32]) [2022-11-16 19:53:09,028 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-11-16 19:53:09,084 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 19:53:09,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:53:09,085 INFO L158 Benchmark]: Toolchain (without parser) took 197037.37ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 47.4MB in the beginning and 58.6MB in the end (delta: -11.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,085 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 67.1MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:53:09,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.61ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 46.4MB in the end (delta: 732.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.79ms. Allocated memory is still 67.1MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,094 INFO L158 Benchmark]: Boogie Preprocessor took 62.91ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 40.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,094 INFO L158 Benchmark]: RCFGBuilder took 28207.05ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 60.4MB in the end (delta: -19.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,095 INFO L158 Benchmark]: TraceAbstraction took 168117.64ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 64.9MB in the end (delta: -5.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,095 INFO L158 Benchmark]: Witness Printer took 113.80ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 58.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 19:53:09,097 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 67.1MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.61ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 46.4MB in the end (delta: 732.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.79ms. Allocated memory is still 67.1MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.91ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 40.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 28207.05ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 60.4MB in the end (delta: -19.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * TraceAbstraction took 168117.64ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 64.9MB in the end (delta: -5.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 113.80ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 58.6MB 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_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,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[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,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_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,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_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,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_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,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_85,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 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: 167.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 62.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 10787 SdHoareTripleChecker+Invalid, 60.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 557 IncrementalHoareTripleChecker+Unchecked, 8791 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1996 mSDtfsCounter, 147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 377 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=12, InterpolantAutomatonStates: 132, 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, 18 MinimizatonAttempts, 40 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 98 PreInvPairs, 106 NumberOfFragments, 411 HoareAnnotationTreeSize, 98 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 338 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 81.8s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 476 ConstructedInterpolants, 316 QuantifiedInterpolants, 7430 SizeOfPredicates, 156 NumberOfNonLiveVariables, 3301 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:53:09,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,136 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:53:09,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,137 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:53:09,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,141 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:53:09,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,141 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:53:09,142 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_102 : bv64 :: (y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_102[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51: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) && 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:53:09,143 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,145 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:53:09,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,145 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:53:09,145 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:53:09,145 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:53:09,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,148 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,148 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,148 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,150 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,150 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,150 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_102,QUANTIFIED] [2022-11-16 19:53:09,151 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:53:09,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,151 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:53:09,151 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:53:09,151 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:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_85,QUANTIFIED] Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_102 : bv64 :: (y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_102[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_102[63:63], v_skolemized_q#valueAsBitvector_102[62:52], v_skolemized_q#valueAsBitvector_102[51:0]), ~Pluszero~LONGDOUBLE()))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\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) && (\exists v_skolemized_q#valueAsBitvector_85 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_85[63:63], v_skolemized_q#valueAsBitvector_85[62:52], v_skolemized_q#valueAsBitvector_85[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_85[63:32]) - InvariantResult [Line: 261]: Loop Invariant [2022-11-16 19:53:09,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,154 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:53:09,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,155 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:53:09,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,156 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:53:09,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-11-16 19:53:09,157 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:53:09,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,157 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:53:09,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,159 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.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(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:53:09,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,160 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,162 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:53:09,163 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,163 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:53:09,163 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,163 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,164 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,164 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,164 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,167 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,167 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:53:09,167 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,168 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:53:09,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,169 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:53:09,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,176 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:53:09,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-11-16 19:53:09,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-11-16 19:53:09,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-11-16 19:53:09,177 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:53:09,399 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-16 19:53:09,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dcb99ab-306a-495d-8338-b6177a246439/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