./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs --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 afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:32:12,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:32:12,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:32:12,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:32:12,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:32:12,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:32:12,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:32:12,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:32:12,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:32:12,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:32:12,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:32:12,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:32:12,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:32:12,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:32:12,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:32:12,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:32:12,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:32:12,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:32:12,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:32:12,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:32:12,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:32:12,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:32:12,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:32:12,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:32:12,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:32:12,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:32:12,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:32:12,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:32:12,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:32:12,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:32:12,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:32:12,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:32:12,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:32:12,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:32:12,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:32:12,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:32:12,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:32:12,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:32:12,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:32:12,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:32:12,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:32:12,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 13:32:12,568 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:32:12,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:32:12,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:32:12,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:32:12,579 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:32:12,579 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:32:12,579 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:32:12,579 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:32:12,586 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:32:12,586 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:32:12,587 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:32:12,588 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:32:12,588 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:32:12,588 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:32:12,588 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:32:12,589 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:32:12,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:32:12,590 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:32:12,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:32:12,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:32:12,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:32:12,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:32:12,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:32:12,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:32:12,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:32:12,591 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:32:12,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:32:12,592 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:32:12,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:32:12,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:32:12,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:32:12,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:32:12,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:32:12,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:32:12,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:32:12,596 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:32:12,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:32:12,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:32:12,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:32:12,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:32:12,597 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/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_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs 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 -> afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 [2021-11-19 13:32:12,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:32:12,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:32:12,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:32:12,924 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:32:12,925 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:32:12,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:12,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/498b9ed23/b8366d71596143b6a2c02fc67ecdd958/FLAGd250fb9aa [2021-11-19 13:32:13,385 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:32:13,386 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:13,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/498b9ed23/b8366d71596143b6a2c02fc67ecdd958/FLAGd250fb9aa [2021-11-19 13:32:13,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/498b9ed23/b8366d71596143b6a2c02fc67ecdd958 [2021-11-19 13:32:13,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:32:13,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:32:13,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:32:13,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:32:13,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:32:13,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:32:13" (1/1) ... [2021-11-19 13:32:13,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2844685d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:13, skipping insertion in model container [2021-11-19 13:32:13,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:32:13" (1/1) ... [2021-11-19 13:32:13,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:32:13,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:32:14,005 WARN L230 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2021-11-19 13:32:14,009 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:32:14,020 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:32:14,034 WARN L230 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2021-11-19 13:32:14,035 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:32:14,048 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:32:14,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14 WrapperNode [2021-11-19 13:32:14,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:32:14,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:32:14,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:32:14,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:32:14,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,081 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2021-11-19 13:32:14,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:32:14,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:32:14,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:32:14,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:32:14,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:32:14,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:32:14,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:32:14,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:32:14,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (1/1) ... [2021-11-19 13:32:14,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:32:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:32:14,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:32:14,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:32:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:32:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:32:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:32:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 13:32:14,245 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:32:14,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:32:14,351 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:32:14,369 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:32:14,369 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 13:32:14,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:32:14 BoogieIcfgContainer [2021-11-19 13:32:14,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:32:14,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:32:14,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:32:14,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:32:14,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:32:13" (1/3) ... [2021-11-19 13:32:14,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6069c514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:32:14, skipping insertion in model container [2021-11-19 13:32:14,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:14" (2/3) ... [2021-11-19 13:32:14,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6069c514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:32:14, skipping insertion in model container [2021-11-19 13:32:14,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:32:14" (3/3) ... [2021-11-19 13:32:14,386 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:14,397 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:32:14,399 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:32:14,473 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:32:14,485 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-19 13:32:14,486 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:32:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-19 13:32:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-19 13:32:14,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:32:14,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-19 13:32:14,518 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:32:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:32:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1497591, now seen corresponding path program 1 times [2021-11-19 13:32:14,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:32:14,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031061719] [2021-11-19 13:32:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:32:14,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:32:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:32:14,628 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 13:32:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:32:14,657 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 13:32:14,659 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 13:32:14,660 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 13:32:14,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:32:14,667 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-19 13:32:14,670 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 13:32:14,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:32:14 BoogieIcfgContainer [2021-11-19 13:32:14,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 13:32:14,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 13:32:14,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 13:32:14,690 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 13:32:14,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:32:14" (3/4) ... [2021-11-19 13:32:14,694 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 13:32:14,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 13:32:14,695 INFO L158 Benchmark]: Toolchain (without parser) took 899.96ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 52.6MB in the end (delta: -6.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-11-19 13:32:14,696 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:32:14,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.59ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.2MB in the beginning and 76.5MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 13:32:14,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.70ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:32:14,698 INFO L158 Benchmark]: Boogie Preprocessor took 17.50ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.4MB in the end (delta: 856.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:32:14,699 INFO L158 Benchmark]: RCFGBuilder took 272.00ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 65.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 13:32:14,700 INFO L158 Benchmark]: TraceAbstraction took 312.15ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 53.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 13:32:14,700 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 100.7MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:32:14,704 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.27ms. Allocated memory is still 83.9MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.59ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.2MB in the beginning and 76.5MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.70ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.50ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 74.4MB in the end (delta: 856.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.00ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 65.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 312.15ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 53.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 100.7MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L27] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-19 13:32:14,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs --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 afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:32:17,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:32:17,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:32:17,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:32:17,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:32:17,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:32:17,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:32:17,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:32:17,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:32:17,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:32:17,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:32:17,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:32:17,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:32:17,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:32:17,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:32:17,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:32:17,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:32:17,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:32:17,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:32:17,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:32:17,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:32:17,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:32:17,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:32:17,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:32:17,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:32:17,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:32:17,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:32:17,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:32:17,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:32:17,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:32:17,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:32:17,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:32:17,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:32:17,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:32:17,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:32:17,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:32:17,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:32:17,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:32:17,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:32:17,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:32:17,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:32:17,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 13:32:17,391 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:32:17,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:32:17,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:32:17,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:32:17,393 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:32:17,394 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:32:17,394 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:32:17,394 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:32:17,394 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:32:17,394 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:32:17,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:32:17,397 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:32:17,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:32:17,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:32:17,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:32:17,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:32:17,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:32:17,398 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:32:17,399 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 13:32:17,399 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 13:32:17,399 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:32:17,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:32:17,399 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:32:17,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:32:17,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:32:17,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 13:32:17,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:32:17,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:32:17,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:32:17,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:32:17,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:32:17,401 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 13:32:17,401 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 13:32:17,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:32:17,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:32:17,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:32:17,402 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/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_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs 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 -> afde2bd0ce234bf8b4933e5a5437c8e1946600ea23fb2a4648cacd72bbfda8e3 [2021-11-19 13:32:17,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:32:17,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:32:17,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:32:17,822 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:32:17,822 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:32:17,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:17,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/7c4ec7c3d/deef18023de2418eb7c1998f0ff0b1ab/FLAGeb9b41256 [2021-11-19 13:32:18,407 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:32:18,408 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:18,415 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/7c4ec7c3d/deef18023de2418eb7c1998f0ff0b1ab/FLAGeb9b41256 [2021-11-19 13:32:18,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/data/7c4ec7c3d/deef18023de2418eb7c1998f0ff0b1ab [2021-11-19 13:32:18,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:32:18,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:32:18,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:32:18,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:32:18,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:32:18,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:32:18" (1/1) ... [2021-11-19 13:32:18,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522cd6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:18, skipping insertion in model container [2021-11-19 13:32:18,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:32:18" (1/1) ... [2021-11-19 13:32:18,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:32:18,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:32:19,036 WARN L230 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2021-11-19 13:32:19,044 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:32:19,059 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:32:19,079 WARN L230 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_8f89eb47-f452-4ad9-870f-be8fe28a120b/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c[667,680] [2021-11-19 13:32:19,080 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:32:19,101 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:32:19,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19 WrapperNode [2021-11-19 13:32:19,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:32:19,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:32:19,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:32:19,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:32:19,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,150 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2021-11-19 13:32:19,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:32:19,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:32:19,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:32:19,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:32:19,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:32:19,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:32:19,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:32:19,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:32:19,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (1/1) ... [2021-11-19 13:32:19,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:32:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:32:19,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:32:19,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:32:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:32:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:32:19,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:32:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 13:32:19,378 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:32:19,380 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:32:23,531 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:32:23,537 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:32:23,537 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 13:32:23,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:32:23 BoogieIcfgContainer [2021-11-19 13:32:23,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:32:23,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:32:23,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:32:23,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:32:23,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:32:18" (1/3) ... [2021-11-19 13:32:23,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:32:23, skipping insertion in model container [2021-11-19 13:32:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:32:19" (2/3) ... [2021-11-19 13:32:23,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:32:23, skipping insertion in model container [2021-11-19 13:32:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:32:23" (3/3) ... [2021-11-19 13:32:23,546 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2021-11-19 13:32:23,552 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:32:23,552 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:32:23,601 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:32:23,611 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-19 13:32:23,611 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:32:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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-19 13:32:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-19 13:32:23,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:32:23,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-19 13:32:23,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:32:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:32:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-11-19 13:32:23,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:32:23,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141273746] [2021-11-19 13:32:23,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:32:23,683 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:32:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:32:23,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:32:23,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 13:32:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:32:24,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 13:32:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:32:30,348 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))))) is different from true [2021-11-19 13:32:30,378 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-19 13:32:30,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:32:30,546 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-19 13:32:30,547 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:32:30,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141273746] [2021-11-19 13:32:30,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141273746] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:32:30,548 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:32:30,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-19 13:32:30,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127496355] [2021-11-19 13:32:30,551 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:32:30,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:32:30,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:32:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:32:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2021-11-19 13:32:30,585 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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.6) internal successors, (8), 5 states have internal predecessors, (8), 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-19 13:32:31,885 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:32:34,133 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:32:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:32:34,149 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-11-19 13:32:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:32:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 5 [2021-11-19 13:32:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:32:34,171 INFO L225 Difference]: With dead ends: 16 [2021-11-19 13:32:34,172 INFO L226 Difference]: Without dead ends: 7 [2021-11-19 13:32:34,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2021-11-19 13:32:34,181 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:32:34,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 8 Unchecked, 1.3s Time] [2021-11-19 13:32:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-11-19 13:32:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-19 13:32:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-19 13:32:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-11-19 13:32:34,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-11-19 13:32:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:32:34,218 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-11-19 13:32:34,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-19 13:32:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-11-19 13:32:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 13:32:34,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:32:34,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 13:32:34,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:32:34,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:32:34,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:32:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:32:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2021-11-19 13:32:34,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:32:34,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346361764] [2021-11-19 13:32:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:32:34,434 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:32:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:32:34,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:32:34,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 13:32:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:32:34,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:32:34,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:32:50,795 WARN L227 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 13:32:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:32:50,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:32:59,395 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2021-11-19 13:33:07,389 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:33:09,517 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:33:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 13:33:09,518 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:33:09,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346361764] [2021-11-19 13:33:09,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346361764] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:33:09,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1594036705] [2021-11-19 13:33:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:33:09,520 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 13:33:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 13:33:09,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 13:33:09,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2021-11-19 13:33:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:33:10,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:33:10,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:33:22,947 WARN L838 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0)))))) is different from false [2021-11-19 13:33:31,523 WARN L838 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:33:33,605 WARN L860 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:33:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 13:33:40,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:33:52,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-11-19 13:33:54,885 WARN L860 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-11-19 13:33:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 13:33:54,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1594036705] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:33:54,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475844318] [2021-11-19 13:33:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:33:54,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:33:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:33:54,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:33:54,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 13:34:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:34:37,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 13:34:37,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:34:48,462 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:34:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 13:34:48,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:01,500 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-19 13:35:03,628 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-19 13:35:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 13:35:12,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475844318] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:12,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-19 13:35:12,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 16 [2021-11-19 13:35:12,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808161151] [2021-11-19 13:35:12,617 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:12,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-19 13:35:12,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:35:12,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-19 13:35:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=52, Unknown=14, NotChecked=140, Total=240 [2021-11-19 13:35:12,619 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 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-19 13:35:14,745 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse3)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse2) .cse3)) .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 13:35:16,978 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse3)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse2) .cse3)) .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:35:19,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|)))) (and .cse0 (or .cse0 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|)))) is different from false [2021-11-19 13:35:21,240 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|)))) (and .cse0 (or .cse0 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|)))) is different from true [2021-11-19 13:35:23,580 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse1))) (exists ((currentRoundingMode RoundingMode)) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse2)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:35:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:23,668 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2021-11-19 13:35:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 13:35:23,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 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 6 [2021-11-19 13:35:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:23,670 INFO L225 Difference]: With dead ends: 11 [2021-11-19 13:35:23,670 INFO L226 Difference]: Without dead ends: 8 [2021-11-19 13:35:23,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 56.6s TimeCoverageRelationStatistics Valid=40, Invalid=53, Unknown=19, NotChecked=230, Total=342 [2021-11-19 13:35:23,672 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:23,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-11-19 13:35:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-11-19 13:35:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-11-19 13:35:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-19 13:35:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-11-19 13:35:23,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-11-19 13:35:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:23,677 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-11-19 13:35:23,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 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-19 13:35:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-11-19 13:35:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:35:23,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:23,678 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-11-19 13:35:23,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:23,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-19 13:35:24,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-19 13:35:24,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:24,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:35:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2021-11-19 13:35:24,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:35:24,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91360265] [2021-11-19 13:35:24,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 13:35:24,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:35:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:35:24,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:35:24,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 13:35:24,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 13:35:24,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:35:24,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 13:35:24,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:32,015 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:35:41,617 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:35:43,893 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:35:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:35:43,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:53,818 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-19 13:35:55,953 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-19 13:36:05,824 WARN L227 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:36:08,074 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-11-19 13:36:10,319 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-19 13:36:20,202 WARN L227 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:36:22,463 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-11-19 13:36:24,718 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-19 13:36:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:36:24,718 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:36:24,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91360265] [2021-11-19 13:36:24,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91360265] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:36:24,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [702127856] [2021-11-19 13:36:24,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 13:36:24,719 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 13:36:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 13:36:24,722 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 13:36:24,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-11-19 13:36:26,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 13:36:26,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:36:26,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 13:36:26,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:36:40,143 WARN L227 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:36:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:36:40,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:36:57,290 WARN L227 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:37:07,195 WARN L227 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:37:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:37:07,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [702127856] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:37:07,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362283710] [2021-11-19 13:37:07,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 13:37:07,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:37:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:37:07,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:37:07,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 13:37:42,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 13:37:42,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:37:42,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 13:37:42,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:37:56,713 WARN L227 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:37:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:37:56,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:38:13,598 WARN L227 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:38:23,416 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:38:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-19 13:38:23,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362283710] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:38:23,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-19 13:38:23,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5, 6] total 10 [2021-11-19 13:38:23,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43882412] [2021-11-19 13:38:23,419 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-19 13:38:23,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 13:38:23,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:38:23,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 13:38:23,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2021-11-19 13:38:23,420 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-19 13:38:25,691 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:38:27,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from false [2021-11-19 13:38:30,204 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2021-11-19 13:38:32,477 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:38:34,750 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:38:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:38:34,786 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2021-11-19 13:38:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:38:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-19 13:38:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:38:34,788 INFO L225 Difference]: With dead ends: 12 [2021-11-19 13:38:34,788 INFO L226 Difference]: Without dead ends: 9 [2021-11-19 13:38:34,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=28, Invalid=25, Unknown=13, NotChecked=144, Total=210 [2021-11-19 13:38:34,789 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:38:34,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-11-19 13:38:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-19 13:38:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-19 13:38:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-19 13:38:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-19 13:38:34,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-11-19 13:38:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:38:34,794 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-19 13:38:34,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-19 13:38:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-19 13:38:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 13:38:34,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:38:34,794 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2021-11-19 13:38:34,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-19 13:38:35,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2021-11-19 13:38:35,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 13:38:35,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:38:35,408 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:38:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:38:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2021-11-19 13:38:35,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:38:35,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420262448] [2021-11-19 13:38:35,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:38:35,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:38:35,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:38:35,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:38:35,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-19 13:38:36,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-19 13:38:36,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:38:36,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 13:38:36,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:38:43,418 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:38:48,488 WARN L227 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:38:50,758 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:39:00,939 WARN L227 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:03,331 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:39:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:39:03,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:39:12,756 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-19 13:39:14,882 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-19 13:39:24,734 WARN L227 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:26,999 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-11-19 13:39:29,257 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-19 13:39:34,857 WARN L227 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 13 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:40,191 WARN L227 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:42,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-11-19 13:39:44,948 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-11-19 13:39:50,252 WARN L227 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 20 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:55,839 WARN L227 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:39:58,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-11-19 13:40:00,596 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-11-19 13:40:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:40:00,597 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:40:00,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420262448] [2021-11-19 13:40:00,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420262448] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:40:00,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1485564257] [2021-11-19 13:40:00,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:40:00,598 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 13:40:00,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 13:40:00,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 13:40:00,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-19 13:40:02,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-19 13:40:02,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:40:03,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 13:40:03,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:40:12,836 WARN L227 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:40:22,959 WARN L227 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:40:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:40:23,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:40:39,867 WARN L227 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:40:45,454 WARN L227 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 13 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:40:50,780 WARN L227 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:40:56,094 WARN L227 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 20 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:41:01,676 WARN L227 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:41:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:41:01,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1485564257] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:41:01,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294990168] [2021-11-19 13:41:01,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:41:01,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:41:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:41:01,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:41:01,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 13:42:51,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-19 13:42:51,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:42:51,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-19 13:42:51,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:43:02,513 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:43:12,279 WARN L227 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:43:14,586 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:43:24,980 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:43:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:43:25,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:43:38,880 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-19 13:43:41,034 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-19 13:43:51,182 WARN L227 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:43:56,437 WARN L227 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:03,450 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |c_ULTIMATE.start_main_~main__x1~0#1|)))) is different from false [2021-11-19 13:44:05,734 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |c_ULTIMATE.start_main_~main__x1~0#1|)))) is different from true [2021-11-19 13:44:11,408 WARN L227 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 11 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:17,103 WARN L227 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 13 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:22,536 WARN L227 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:28,653 WARN L227 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 8 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:31,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse2)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse2)))) (or (fp.eq .cse0 .cse1) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse2)) .cse0)))))) is different from false [2021-11-19 13:44:33,458 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse2)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse2)))) (or (fp.eq .cse0 .cse1) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse2)) .cse0)))))) is different from true [2021-11-19 13:44:38,822 WARN L227 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 20 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:44,478 WARN L227 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 16 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:50,160 WARN L227 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:44:52,569 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2021-11-19 13:44:54,963 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2021-11-19 13:44:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-19 13:44:54,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294990168] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:44:54,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-19 13:44:54,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 18 [2021-11-19 13:44:54,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923921545] [2021-11-19 13:44:54,965 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-19 13:44:54,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-19 13:44:54,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:44:54,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-19 13:44:54,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=25, Unknown=21, NotChecked=260, Total=342 [2021-11-19 13:44:54,969 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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-19 13:44:57,406 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse4))) .cse4)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse4)))) (let ((.cse0 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse4)) .cse2))) (.cse1 (fp.eq .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (and (or .cse0 .cse1) (or .cse0 (fp.eq .cse2 .cse3) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2021-11-19 13:44:59,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse4)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse4)))) (let ((.cse2 (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse3 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse4)) .cse0)))) (and (or (fp.eq .cse0 .cse1) .cse2 .cse3) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse4)) |c_ULTIMATE.start_main_~main__x1~0#1|)))))) is different from false [2021-11-19 13:45:02,261 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse4)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse4)))) (let ((.cse2 (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse3 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse4)) .cse0)))) (and (or (fp.eq .cse0 .cse1) .cse2 .cse3) (or .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse4)) |c_ULTIMATE.start_main_~main__x1~0#1|)))))) is different from true [2021-11-19 13:45:04,796 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (let ((.cse2 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1)) .cse4))) (.cse3 (fp.eq .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (and (= .cse0 |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse1))) (or .cse2 .cse3) (or .cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) .cse3 (fp.eq .cse4 |c_ULTIMATE.start_main_~main__x1~0#1|)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2021-11-19 13:45:06,938 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or .cse1 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) .cse2) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse0))) (or .cse1 .cse2) (= .cse3 |c_ULTIMATE.start_main_~main__x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-19 13:45:09,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse1 (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or .cse1 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) .cse2) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse0))) (or .cse1 .cse2) (= .cse3 |c_ULTIMATE.start_main_~main__x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 13:45:11,866 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 13:45:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:45:11,932 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-11-19 13:45:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:45:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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 8 [2021-11-19 13:45:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:45:11,933 INFO L225 Difference]: With dead ends: 13 [2021-11-19 13:45:11,933 INFO L226 Difference]: Without dead ends: 10 [2021-11-19 13:45:11,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=46, Invalid=28, Unknown=28, NotChecked=450, Total=552 [2021-11-19 13:45:11,937 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:45:11,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2021-11-19 13:45:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-11-19 13:45:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-11-19 13:45:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-19 13:45:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-11-19 13:45:11,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2021-11-19 13:45:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:45:11,943 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-11-19 13:45:11,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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-19 13:45:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-11-19 13:45:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-19 13:45:11,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:45:11,944 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2021-11-19 13:45:11,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-19 13:45:12,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-19 13:45:12,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-19 13:45:12,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:45:12,555 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:45:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:45:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2021-11-19 13:45:12,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:45:12,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810490352] [2021-11-19 13:45:12,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:45:12,557 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:45:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:45:12,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:45:12,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-19 13:45:13,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:45:13,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:45:13,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 13:45:13,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:45:20,935 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:45:26,023 WARN L227 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:45:28,303 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:45:33,971 WARN L227 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:45:36,381 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 13:45:43,132 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true [2021-11-19 13:45:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-19 13:45:43,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:45:50,636 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2021-11-19 13:45:57,478 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:45:59,765 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:46:06,967 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:46:09,362 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:46:14,437 WARN L227 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:46:16,963 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:46:19,505 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:46:24,545 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 23 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:46:27,133 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-11-19 13:46:29,647 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-11-19 13:46:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-19 13:46:29,648 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:46:29,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810490352] [2021-11-19 13:46:29,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810490352] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:46:29,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [879375425] [2021-11-19 13:46:29,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:46:29,648 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 13:46:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 13:46:29,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 13:46:29,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f89eb47-f452-4ad9-870f-be8fe28a120b/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-19 13:46:32,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:46:32,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:46:32,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 13:46:32,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:46:42,694 WARN L227 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:46:48,389 WARN L227 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 13:46:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-19 13:46:53,055 INFO L328 TraceCheckSpWp]: Computing backward predicates...