./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8 --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 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:14:29,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:14:29,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:14:29,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:14:29,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:14:29,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:14:29,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:14:29,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:14:29,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:14:29,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:14:29,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:14:29,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:14:29,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:14:29,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:14:29,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:14:29,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:14:29,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:14:29,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:14:29,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:14:29,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:14:29,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:14:29,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:14:29,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:14:29,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:14:29,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:14:29,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:14:29,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:14:29,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:14:29,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:14:29,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:14:29,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:14:29,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:14:29,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:14:29,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:14:29,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:14:29,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:14:29,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:14:29,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:14:29,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:14:29,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:14:29,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:14:29,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:14:29,385 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:14:29,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:14:29,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:14:29,388 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:14:29,388 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:14:29,389 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:14:29,389 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:14:29,389 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:14:29,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:14:29,398 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:14:29,399 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:14:29,400 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:14:29,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:14:29,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:14:29,400 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:14:29,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:14:29,402 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:14:29,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:14:29,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:14:29,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:14:29,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:14:29,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:14:29,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:14:29,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:14:29,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:14:29,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:14:29,405 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:14:29,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:14:29,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:14:29,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:14:29,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:14:29,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:14:29,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:14:29,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:14:29,409 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:14:29,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:14:29,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:14:29,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:14:29,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:14:29,410 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/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_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8 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 -> 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 [2021-11-07 02:14:29,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:14:29,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:14:29,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:14:29,818 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:14:29,819 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:14:29,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:29,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/651eac3fd/fcd0dd74ed924f4d9f3721a3ecb36b3c/FLAG4b2540d3f [2021-11-07 02:14:30,585 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:14:30,587 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:30,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/651eac3fd/fcd0dd74ed924f4d9f3721a3ecb36b3c/FLAG4b2540d3f [2021-11-07 02:14:30,931 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/651eac3fd/fcd0dd74ed924f4d9f3721a3ecb36b3c [2021-11-07 02:14:30,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:14:30,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:14:30,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:14:30,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:14:30,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:14:30,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:14:30" (1/1) ... [2021-11-07 02:14:30,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c85db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:30, skipping insertion in model container [2021-11-07 02:14:30,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:14:30" (1/1) ... [2021-11-07 02:14:30,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:14:30,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:14:31,222 WARN L228 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_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-11-07 02:14:31,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:14:31,241 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:14:31,262 WARN L228 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_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-11-07 02:14:31,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:14:31,283 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:14:31,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31 WrapperNode [2021-11-07 02:14:31,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:14:31,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:14:31,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:14:31,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:14:31,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:14:31,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:14:31,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:14:31,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:14:31,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:14:31,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:14:31,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:14:31,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:14:31,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (1/1) ... [2021-11-07 02:14:31,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:14:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:14:31,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:14:31,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:14:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:14:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:14:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:14:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:14:31,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:14:31,779 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 02:14:31,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:31 BoogieIcfgContainer [2021-11-07 02:14:31,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:14:31,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:14:31,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:14:31,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:14:31,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:14:30" (1/3) ... [2021-11-07 02:14:31,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3299b1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:14:31, skipping insertion in model container [2021-11-07 02:14:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:31" (2/3) ... [2021-11-07 02:14:31,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3299b1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:14:31, skipping insertion in model container [2021-11-07 02:14:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:31" (3/3) ... [2021-11-07 02:14:31,792 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:31,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:14:31,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 02:14:31,890 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:14:31,909 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:14:31,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 02:14:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 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) [2021-11-07 02:14:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:14:31,932 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:14:31,933 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:14:31,934 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:14:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:14:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1602314196, now seen corresponding path program 1 times [2021-11-07 02:14:31,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:14:31,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450923344] [2021-11-07 02:14:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:14:31,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:14:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:14:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:14:32,266 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:14:32,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450923344] [2021-11-07 02:14:32,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450923344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:14:32,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:14:32,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:14:32,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821493758] [2021-11-07 02:14:32,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:14:32,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:14:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:14:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:14:32,298 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:14:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:14:32,421 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-07 02:14:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:14:32,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 02:14:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:14:32,436 INFO L225 Difference]: With dead ends: 23 [2021-11-07 02:14:32,436 INFO L226 Difference]: Without dead ends: 11 [2021-11-07 02:14:32,442 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:14:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-11-07 02:14:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-11-07 02:14:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) [2021-11-07 02:14:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-11-07 02:14:32,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2021-11-07 02:14:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:14:32,483 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-11-07 02:14:32,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:14:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-11-07 02:14:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:14:32,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:14:32,485 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:14:32,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:14:32,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:14:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:14:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1619324857, now seen corresponding path program 1 times [2021-11-07 02:14:32,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:14:32,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139233028] [2021-11-07 02:14:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:14:32,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:14:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:14:32,544 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:14:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:14:32,609 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:14:32,610 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:14:32,612 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:14:32,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:14:32,619 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 02:14:32,622 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:14:32,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:14:32 BoogieIcfgContainer [2021-11-07 02:14:32,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:14:32,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:14:32,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:14:32,668 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:14:32,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:31" (3/4) ... [2021-11-07 02:14:32,674 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 02:14:32,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:14:32,678 INFO L168 Benchmark]: Toolchain (without parser) took 1738.93 ms. Allocated memory is still 119.5 MB. Free memory was 84.4 MB in the beginning and 53.5 MB in the end (delta: 30.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:14:32,679 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 77.6 MB. Free memory is still 36.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:14:32,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.73 ms. Allocated memory is still 119.5 MB. Free memory was 84.1 MB in the beginning and 93.4 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:14:32,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.86 ms. Allocated memory is still 119.5 MB. Free memory was 93.4 MB in the beginning and 91.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:14:32,685 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 ms. Allocated memory is still 119.5 MB. Free memory was 91.7 MB in the beginning and 91.0 MB in the end (delta: 692.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:14:32,691 INFO L168 Benchmark]: RCFGBuilder took 407.80 ms. Allocated memory is still 119.5 MB. Free memory was 90.4 MB in the beginning and 79.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:14:32,692 INFO L168 Benchmark]: TraceAbstraction took 882.72 ms. Allocated memory is still 119.5 MB. Free memory was 79.9 MB in the beginning and 54.1 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:14:32,693 INFO L168 Benchmark]: Witness Printer took 7.17 ms. Allocated memory is still 119.5 MB. Free memory was 54.1 MB in the beginning and 53.5 MB in the end (delta: 626.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:14:32,698 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.33 ms. Allocated memory is still 77.6 MB. Free memory is still 36.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 335.73 ms. Allocated memory is still 119.5 MB. Free memory was 84.1 MB in the beginning and 93.4 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.86 ms. Allocated memory is still 119.5 MB. Free memory was 93.4 MB in the beginning and 91.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.64 ms. Allocated memory is still 119.5 MB. Free memory was 91.7 MB in the beginning and 91.0 MB in the end (delta: 692.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 407.80 ms. Allocated memory is still 119.5 MB. Free memory was 90.4 MB in the beginning and 79.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 882.72 ms. Allocated memory is still 119.5 MB. Free memory was 79.9 MB in the beginning and 54.1 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Witness Printer took 7.17 ms. Allocated memory is still 119.5 MB. Free memory was 54.1 MB in the beginning and 53.5 MB in the end (delta: 626.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * 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: 45]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 26. Possible FailurePath: [L1] int __return_main; [L12] int __return_76; [L15] double main__x; [L16] double main__y; [L17] main__x = __VERIFIER_nondet_double() [L18] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L19] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L21] COND TRUE main__x <= 10.0 [L23] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L24] COND TRUE main____CPAchecker_TMP_0 != 0 [L26] main__y = (main__x * main__x) - main__x [L27] COND FALSE !(main__y >= 0) [L69] main__y = (main__x * main__x) + 2.0 [L31] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L32] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L58] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L39] int __tmp_1; [L40] __tmp_1 = main____CPAchecker_TMP_1 [L41] int __VERIFIER_assert__cond; [L42] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L43] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L45] reach_error() VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 SDtfs, 20 SDslu, 27 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 02:14:32,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8 --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 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:14:35,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:14:35,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:14:35,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:14:35,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:14:35,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:14:35,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:14:35,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:14:35,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:14:35,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:14:35,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:14:35,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:14:35,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:14:35,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:14:35,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:14:35,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:14:35,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:14:35,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:14:35,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:14:35,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:14:35,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:14:35,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:14:35,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:14:35,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:14:35,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:14:35,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:14:35,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:14:35,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:14:35,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:14:35,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:14:35,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:14:35,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:14:35,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:14:35,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:14:35,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:14:35,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:14:35,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:14:35,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:14:35,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:14:35,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:14:35,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:14:35,826 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 02:14:35,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:14:35,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:14:35,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:14:35,887 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:14:35,887 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:14:35,888 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:14:35,888 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:14:35,888 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:14:35,888 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:14:35,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:14:35,892 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:14:35,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:14:35,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:14:35,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:14:35,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:14:35,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:14:35,893 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:14:35,894 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 02:14:35,894 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 02:14:35,894 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:14:35,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:14:35,895 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:14:35,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:14:35,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:14:35,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 02:14:35,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:14:35,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:14:35,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:14:35,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:14:35,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:14:35,897 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 02:14:35,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 02:14:35,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:14:35,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:14:35,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:14:35,899 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_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/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_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8 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 -> 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 [2021-11-07 02:14:36,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:14:36,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:14:36,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:14:36,478 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:14:36,479 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:14:36,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:36,566 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/1483c0ec8/9fc08c25aedb41b298043385c83c0835/FLAG517a82520 [2021-11-07 02:14:37,163 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:14:37,164 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:37,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/1483c0ec8/9fc08c25aedb41b298043385c83c0835/FLAG517a82520 [2021-11-07 02:14:37,505 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/data/1483c0ec8/9fc08c25aedb41b298043385c83c0835 [2021-11-07 02:14:37,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:14:37,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:14:37,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:14:37,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:14:37,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:14:37,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571dc40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37, skipping insertion in model container [2021-11-07 02:14:37,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:14:37,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:14:37,775 WARN L228 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_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-11-07 02:14:37,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:14:37,800 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:14:37,822 WARN L228 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_f380ac63-589a-4803-940f-4dc197b87b87/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-11-07 02:14:37,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:14:37,866 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:14:37,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37 WrapperNode [2021-11-07 02:14:37,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:14:37,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:14:37,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:14:37,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:14:37,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:14:37,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:14:37,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:14:37,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:14:37,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:14:37,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:14:37,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:14:37,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:14:37,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (1/1) ... [2021-11-07 02:14:37,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:14:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:14:38,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:14:38,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:14:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 02:14:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:14:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:14:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:14:41,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:14:41,584 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 02:14:41,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:41 BoogieIcfgContainer [2021-11-07 02:14:41,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:14:41,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:14:41,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:14:41,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:14:41,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:14:37" (1/3) ... [2021-11-07 02:14:41,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2efcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:14:41, skipping insertion in model container [2021-11-07 02:14:41,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:14:37" (2/3) ... [2021-11-07 02:14:41,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2efcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:14:41, skipping insertion in model container [2021-11-07 02:14:41,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:41" (3/3) ... [2021-11-07 02:14:41,597 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-11-07 02:14:41,604 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:14:41,604 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 02:14:41,674 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:14:41,683 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:14:41,683 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 02:14:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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) [2021-11-07 02:14:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:14:41,706 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:14:41,706 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:14:41,707 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:14:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:14:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2021-11-07 02:14:41,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:14:41,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615711305] [2021-11-07 02:14:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:14:41,735 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:14:41,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:14:41,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:14:41,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 02:14:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:14:42,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 02:14:42,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:14:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:14:42,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:14:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:14:42,812 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:14:42,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615711305] [2021-11-07 02:14:42,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615711305] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:14:42,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:14:42,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 02:14:42,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128655376] [2021-11-07 02:14:42,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:14:42,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:14:42,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:14:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:14:42,857 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2021-11-07 02:14:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:14:42,999 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-11-07 02:14:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:14:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 12 [2021-11-07 02:14:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:14:43,014 INFO L225 Difference]: With dead ends: 30 [2021-11-07 02:14:43,014 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 02:14:43,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:14:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 02:14:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 02:14:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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) [2021-11-07 02:14:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-07 02:14:43,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2021-11-07 02:14:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:14:43,047 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-07 02:14:43,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2021-11-07 02:14:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-07 02:14:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:14:43,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:14:43,048 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:14:43,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 02:14:43,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:14:43,249 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:14:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:14:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2021-11-07 02:14:43,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:14:43,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146956957] [2021-11-07 02:14:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:14:43,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:14:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:14:43,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:14:43,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 02:14:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:14:43,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 02:14:43,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:14:53,441 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2021-11-07 02:15:11,990 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from false [2021-11-07 02:15:14,020 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from true [2021-11-07 02:15:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:42,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:15:48,250 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) is different from false [2021-11-07 02:15:50,293 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) is different from true [2021-11-07 02:16:07,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from false [2021-11-07 02:16:09,991 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from true [2021-11-07 02:16:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:16:18,196 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:16:18,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146956957] [2021-11-07 02:16:18,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146956957] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:16:18,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:16:18,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-07 02:16:18,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940556129] [2021-11-07 02:16:18,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:16:18,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:16:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:16:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=13, Unknown=7, NotChecked=36, Total=72 [2021-11-07 02:16:18,202 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-07 02:16:20,242 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))) is different from false [2021-11-07 02:16:22,282 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))) is different from true [2021-11-07 02:16:25,173 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:16:27,215 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from false [2021-11-07 02:16:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:16:27,254 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2021-11-07 02:16:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:16:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 12 [2021-11-07 02:16:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:16:27,256 INFO L225 Difference]: With dead ends: 27 [2021-11-07 02:16:27,256 INFO L226 Difference]: Without dead ends: 22 [2021-11-07 02:16:27,257 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=22, Invalid=15, Unknown=11, NotChecked=84, Total=132 [2021-11-07 02:16:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-07 02:16:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2021-11-07 02:16:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:16:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-07 02:16:27,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2021-11-07 02:16:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:16:27,264 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-07 02:16:27,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-07 02:16:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-07 02:16:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:16:27,266 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:16:27,266 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:16:27,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-07 02:16:27,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:16:27,467 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:16:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:16:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -125142316, now seen corresponding path program 1 times [2021-11-07 02:16:27,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:16:27,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744111831] [2021-11-07 02:16:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:16:27,469 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:16:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:16:27,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:16:27,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 02:16:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:16:28,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 02:16:28,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:16:41,752 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2021-11-07 02:17:04,845 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-11-07 02:17:06,932 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-11-07 02:17:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:17:49,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:17:56,144 WARN L860 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))) is different from true [2021-11-07 02:18:17,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-11-07 02:18:19,479 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-11-07 02:18:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:18:30,127 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:18:30,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744111831] [2021-11-07 02:18:30,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744111831] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:18:30,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:18:30,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-07 02:18:30,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176617622] [2021-11-07 02:18:30,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:18:30,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:18:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:18:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2021-11-07 02:18:30,131 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-07 02:18:32,266 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53)))) is different from true [2021-11-07 02:18:44,554 WARN L207 SmtUtils]: Spent 7.46 s on a formula simplification that was a NOOP. DAG size: 13 [2021-11-07 02:18:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:18:51,230 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-11-07 02:18:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:18:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 12 [2021-11-07 02:18:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:18:51,232 INFO L225 Difference]: With dead ends: 21 [2021-11-07 02:18:51,232 INFO L226 Difference]: Without dead ends: 16 [2021-11-07 02:18:51,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=18, Invalid=13, Unknown=9, NotChecked=50, Total=90 [2021-11-07 02:18:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-07 02:18:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-07 02:18:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:18:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-07 02:18:51,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-11-07 02:18:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:18:51,237 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-07 02:18:51,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-07 02:18:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-07 02:18:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:18:51,238 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:18:51,238 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:18:51,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:18:51,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:18:51,450 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:18:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:18:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 519293970, now seen corresponding path program 1 times [2021-11-07 02:18:51,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:18:51,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383831233] [2021-11-07 02:18:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:18:51,454 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:18:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:18:51,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:18:51,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 02:18:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:18:51,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 02:18:51,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:19:09,300 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:19:27,932 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:19:58,322 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:20:19,029 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from false [2021-11-07 02:20:21,065 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from true [2021-11-07 02:20:29,204 WARN L207 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 5 DAG size of output: 1 [2021-11-07 02:20:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:20:29,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:20:43,698 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) is different from true [2021-11-07 02:20:58,575 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-07 02:21:16,712 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-07 02:21:18,762 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-07 02:21:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:21:24,438 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:21:24,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383831233] [2021-11-07 02:21:24,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383831233] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:24,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:24,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2021-11-07 02:21:24,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465274006] [2021-11-07 02:21:24,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:21:24,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:21:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:21:24,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=32, Unknown=9, NotChecked=112, Total=182 [2021-11-07 02:21:24,440 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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) [2021-11-07 02:21:26,533 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:21:28,586 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:21:30,635 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:21:32,687 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:21:34,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (and (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 02:21:38,753 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:21:40,818 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:21:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:40,838 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-11-07 02:21:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:21:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 [2021-11-07 02:21:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:40,840 INFO L225 Difference]: With dead ends: 22 [2021-11-07 02:21:40,840 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 02:21:40,841 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=39, Invalid=35, Unknown=16, NotChecked=252, Total=342 [2021-11-07 02:21:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 02:21:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 02:21:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 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) [2021-11-07 02:21:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2021-11-07 02:21:40,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2021-11-07 02:21:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:40,844 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2021-11-07 02:21:40,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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) [2021-11-07 02:21:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2021-11-07 02:21:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:21:40,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:40,846 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:40,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 02:21:41,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:21:41,058 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -101291445, now seen corresponding path program 1 times [2021-11-07 02:21:41,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:21:41,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41014767] [2021-11-07 02:21:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:41,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:21:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:21:41,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:21:41,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 02:21:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:41,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:21:41,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:21:50,458 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:22:07,933 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:22:24,834 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from false [2021-11-07 02:22:26,924 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from true [2021-11-07 02:23:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:12,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:23,679 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from false [2021-11-07 02:23:25,801 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2021-11-07 02:23:47,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from false [2021-11-07 02:23:49,790 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from true [2021-11-07 02:24:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:14,346 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:24:14,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41014767] [2021-11-07 02:24:14,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41014767] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:14,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:14,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-11-07 02:24:14,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417344275] [2021-11-07 02:24:14,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 02:24:14,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:24:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 02:24:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=8, NotChecked=60, Total=110 [2021-11-07 02:24:14,349 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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) [2021-11-07 02:24:16,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:24:18,586 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:24:20,703 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 02:24:24,068 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:24:26,203 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:24:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:26,211 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2021-11-07 02:24:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 [2021-11-07 02:24:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:26,212 INFO L225 Difference]: With dead ends: 14 [2021-11-07 02:24:26,212 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 02:24:26,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=29, Invalid=24, Unknown=13, NotChecked=144, Total=210 [2021-11-07 02:24:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 02:24:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 02:24:26,213 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) [2021-11-07 02:24:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 02:24:26,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2021-11-07 02:24:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:26,214 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 02:24:26,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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) [2021-11-07 02:24:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 02:24:26,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 02:24:26,217 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:26,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 02:24:26,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:24:26,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 02:24:26,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:26,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:26,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:26,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:26:13,870 WARN L207 SmtUtils]: Spent 1.79 m on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-11-07 02:26:13,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 02:26:13,874 INFO L853 garLoopResultBuilder]: At program point L64(lines 32 65) the Hoare annotation is: false [2021-11-07 02:26:13,874 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 71) no Hoare annotation was computed. [2021-11-07 02:26:13,874 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 81) no Hoare annotation was computed. [2021-11-07 02:26:13,875 INFO L860 garLoopResultBuilder]: At program point L85(lines 13 87) the Hoare annotation is: true [2021-11-07 02:26:13,875 INFO L857 garLoopResultBuilder]: For program point L19(lines 19 86) no Hoare annotation was computed. [2021-11-07 02:26:13,876 INFO L857 garLoopResultBuilder]: For program point L34(lines 34 60) no Hoare annotation was computed. [2021-11-07 02:26:13,876 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 65) no Hoare annotation was computed. [2021-11-07 02:26:13,876 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-07 02:26:13,876 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 02:26:13,877 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-07 02:26:13,877 INFO L853 garLoopResultBuilder]: At program point L59(lines 34 60) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2021-11-07 02:26:13,877 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 76) no Hoare annotation was computed. [2021-11-07 02:26:13,877 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2021-11-07 02:26:13,878 INFO L857 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2021-11-07 02:26:13,878 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 52) no Hoare annotation was computed. [2021-11-07 02:26:13,878 INFO L853 garLoopResultBuilder]: At program point L70(lines 27 71) the Hoare annotation is: (let ((.cse0 (fp.leq ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) currentRoundingMode 105.0))) (.cse2 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (not (fp.geq (fp.sub currentRoundingMode .cse1 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))) (= ULTIMATE.start_main_~main__y~0 (fp.add currentRoundingMode .cse1 ((_ to_fp 11 53) currentRoundingMode 2.0)))))) .cse2) (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode 10.0))) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse3) ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse3)))) .cse0 (or (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) .cse2))) [2021-11-07 02:26:13,881 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-07 02:26:13,883 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:26:13,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,908 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,908 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,909 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,909 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:13,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:13,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:13,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:13,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:26:13 BoogieIcfgContainer [2021-11-07 02:26:13,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:26:13,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:26:13,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:26:13,914 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:26:13,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:14:41" (3/4) ... [2021-11-07 02:26:13,919 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 02:26:13,931 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-07 02:26:13,931 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-07 02:26:13,931 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 02:26:13,932 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 02:26:13,961 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && ((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) || (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) [2021-11-07 02:26:13,991 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:26:13,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:26:13,992 INFO L168 Benchmark]: Toolchain (without parser) took 696480.67 ms. Allocated memory was 77.6 MB in the beginning and 94.4 MB in the end (delta: 16.8 MB). Free memory was 43.5 MB in the beginning and 34.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,993 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 77.6 MB. Free memory was 59.8 MB in the beginning and 59.7 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:26:13,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.12 ms. Allocated memory is still 77.6 MB. Free memory was 43.3 MB in the beginning and 62.3 MB in the end (delta: -19.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.44 ms. Allocated memory is still 77.6 MB. Free memory was 62.0 MB in the beginning and 60.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,995 INFO L168 Benchmark]: Boogie Preprocessor took 53.94 ms. Allocated memory is still 77.6 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 974.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:26:13,995 INFO L168 Benchmark]: RCFGBuilder took 3616.77 ms. Allocated memory is still 77.6 MB. Free memory was 59.2 MB in the beginning and 49.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,996 INFO L168 Benchmark]: TraceAbstraction took 692324.93 ms. Allocated memory was 77.6 MB in the beginning and 94.4 MB in the end (delta: 16.8 MB). Free memory was 48.8 MB in the beginning and 36.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,996 INFO L168 Benchmark]: Witness Printer took 77.18 ms. Allocated memory is still 94.4 MB. Free memory was 36.3 MB in the beginning and 34.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:26:13,999 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.35 ms. Allocated memory is still 77.6 MB. Free memory was 59.8 MB in the beginning and 59.7 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 348.12 ms. Allocated memory is still 77.6 MB. Free memory was 43.3 MB in the beginning and 62.3 MB in the end (delta: -19.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.44 ms. Allocated memory is still 77.6 MB. Free memory was 62.0 MB in the beginning and 60.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.94 ms. Allocated memory is still 77.6 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 974.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 3616.77 ms. Allocated memory is still 77.6 MB. Free memory was 59.2 MB in the beginning and 49.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 692324.93 ms. Allocated memory was 77.6 MB in the beginning and 94.4 MB in the end (delta: 16.8 MB). Free memory was 48.8 MB in the beginning and 36.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. * Witness Printer took 77.18 ms. Allocated memory is still 94.4 MB. Free memory was 36.3 MB in the beginning and 34.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,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[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 45]: 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 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 692.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 107.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 23 SDslu, 106 SDs, 0 SdLazy, 35 SolverSat, 3 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 117.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 102 HoareAnnotationTreeSize, 4 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 46 FormulaSimplificationTreeSizeReductionInter, 107.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 522.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 33 QuantifiedInterpolants, 1083 SizeOfPredicates, 19 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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: 34]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant [2021-11-07 02:26:14,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:14,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:14,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,042 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,044 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-11-07 02:26:14,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:14,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-11-07 02:26:14,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-11-07 02:26:14,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && ((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) || (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) RESULT: Ultimate proved your program to be correct! [2021-11-07 02:26:14,269 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-07 02:26:14,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f380ac63-589a-4803-940f-4dc197b87b87/bin/utaipan-UUZaoUuFF8/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 Writing output log to file Ultimate.log Result: TRUE