./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan --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 a489919c33568e9fb270076fed14bc2a86abb299 ................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan --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 a489919c33568e9fb270076fed14bc2a86abb299 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1853479610] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [55792028] failed with TRACE_FEASIBLE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 18:29:07,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:29:07,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:29:07,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:29:07,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:29:07,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:29:07,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:29:07,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:29:07,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:29:07,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:29:07,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:29:07,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:29:07,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:29:07,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:29:07,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:29:07,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:29:07,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:29:07,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:29:07,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:29:07,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:29:07,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:29:07,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:29:07,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:29:07,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:29:07,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:29:07,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:29:07,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:29:07,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:29:07,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:29:07,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:29:07,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:29:07,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:29:07,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:29:07,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:29:07,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:29:07,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:29:07,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:29:07,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:29:07,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:29:07,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:29:07,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:29:07,686 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:29:07,702 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:29:07,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:29:07,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:29:07,703 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:29:07,703 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:29:07,704 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:29:07,704 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:29:07,704 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:29:07,704 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:29:07,704 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:29:07,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:29:07,705 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:29:07,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:29:07,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:29:07,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:29:07,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:29:07,707 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-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/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-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan 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 -> a489919c33568e9fb270076fed14bc2a86abb299 [2020-12-09 18:29:07,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:29:07,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:29:07,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:29:07,908 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:29:07,908 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:29:07,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:07,951 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/4afa2520f/8310a732bf37405394dee26a58a6b254/FLAGb3641775e [2020-12-09 18:29:08,332 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:29:08,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:08,338 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/4afa2520f/8310a732bf37405394dee26a58a6b254/FLAGb3641775e [2020-12-09 18:29:08,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/4afa2520f/8310a732bf37405394dee26a58a6b254 [2020-12-09 18:29:08,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:29:08,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:29:08,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:29:08,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:29:08,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:29:08,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131b8d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08, skipping insertion in model container [2020-12-09 18:29:08,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:29:08,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:29:08,509 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2020-12-09 18:29:08,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:29:08,521 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:29:08,542 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2020-12-09 18:29:08,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:29:08,559 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:29:08,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08 WrapperNode [2020-12-09 18:29:08,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:29:08,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:29:08,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:29:08,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:29:08,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:29:08,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:29:08,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:29:08,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:29:08,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... [2020-12-09 18:29:08,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:29:08,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:29:08,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:29:08,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:29:08,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:29:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 18:29:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:29:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-12-09 18:29:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:29:08,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-12-09 18:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 18:29:08,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:29:08,895 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 18:29:08,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:08 BoogieIcfgContainer [2020-12-09 18:29:08,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:29:08,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:29:08,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:29:08,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:29:08,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:29:08" (1/3) ... [2020-12-09 18:29:08,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e98ac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:08, skipping insertion in model container [2020-12-09 18:29:08,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:08" (2/3) ... [2020-12-09 18:29:08,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e98ac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:08, skipping insertion in model container [2020-12-09 18:29:08,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:08" (3/3) ... [2020-12-09 18:29:08,905 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:08,917 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:29:08,920 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:29:08,930 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:29:08,952 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:29:08,952 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:29:08,952 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:29:08,953 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:29:08,953 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:29:08,953 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:29:08,953 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:29:08,953 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:29:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-12-09 18:29:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 18:29:08,972 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:08,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:08,973 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2020-12-09 18:29:08,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:29:08,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282770034] [2020-12-09 18:29:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:29:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:29:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:29:09,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282770034] [2020-12-09 18:29:09,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:29:09,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:29:09,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270646921] [2020-12-09 18:29:09,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:29:09,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:29:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:29:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:29:09,172 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-12-09 18:29:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:29:09,244 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2020-12-09 18:29:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 18:29:09,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 18:29:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:29:09,251 INFO L225 Difference]: With dead ends: 44 [2020-12-09 18:29:09,251 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 18:29:09,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 18:29:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 18:29:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2020-12-09 18:29:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-12-09 18:29:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-12-09 18:29:09,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2020-12-09 18:29:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:29:09,275 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-12-09 18:29:09,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:29:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-12-09 18:29:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 18:29:09,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:09,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:09,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 18:29:09,276 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2020-12-09 18:29:09,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:29:09,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895770605] [2020-12-09 18:29:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:29:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:29:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:29:09,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895770605] [2020-12-09 18:29:09,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:29:09,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:29:09,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095803607] [2020-12-09 18:29:09,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:29:09,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:29:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:29:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:29:09,324 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 3 states. [2020-12-09 18:29:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:29:09,345 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-12-09 18:29:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:29:09,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 18:29:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:29:09,346 INFO L225 Difference]: With dead ends: 33 [2020-12-09 18:29:09,346 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 18:29:09,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:29:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 18:29:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2020-12-09 18:29:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-09 18:29:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-12-09 18:29:09,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2020-12-09 18:29:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:29:09,351 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-12-09 18:29:09,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:29:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-12-09 18:29:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 18:29:09,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:09,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:09,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 18:29:09,352 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2020-12-09 18:29:09,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:29:09,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784444223] [2020-12-09 18:29:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:29:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:29:09,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:29:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:29:09,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:29:09,413 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 18:29:09,413 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 18:29:09,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 18:29:09,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:29:09 BoogieIcfgContainer [2020-12-09 18:29:09,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:29:09,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:29:09,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:29:09,441 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:29:09,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:08" (3/4) ... [2020-12-09 18:29:09,443 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 18:29:09,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:29:09,445 INFO L168 Benchmark]: Toolchain (without parser) took 1090.06 ms. Allocated memory is still 121.6 MB. Free memory was 84.1 MB in the beginning and 89.6 MB in the end (delta: -5.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:29:09,445 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 121.6 MB. Free memory is still 100.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:29:09,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.53 ms. Allocated memory is still 121.6 MB. Free memory was 83.9 MB in the beginning and 97.2 MB in the end (delta: -13.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 18:29:09,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.77 ms. Allocated memory is still 121.6 MB. Free memory was 96.6 MB in the beginning and 95.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:29:09,446 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 121.6 MB. Free memory was 95.1 MB in the beginning and 94.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:29:09,447 INFO L168 Benchmark]: RCFGBuilder took 276.94 ms. Allocated memory is still 121.6 MB. Free memory was 94.0 MB in the beginning and 77.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:29:09,447 INFO L168 Benchmark]: TraceAbstraction took 541.70 ms. Allocated memory is still 121.6 MB. Free memory was 76.7 MB in the beginning and 89.6 MB in the end (delta: -12.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:29:09,447 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 121.6 MB. Free memory is still 89.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:29:09,450 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.16 ms. Allocated memory is still 121.6 MB. Free memory is still 100.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 204.53 ms. Allocated memory is still 121.6 MB. Free memory was 83.9 MB in the beginning and 97.2 MB in the end (delta: -13.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.77 ms. Allocated memory is still 121.6 MB. Free memory was 96.6 MB in the beginning and 95.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 121.6 MB. Free memory was 95.1 MB in the beginning and 94.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 276.94 ms. Allocated memory is still 121.6 MB. Free memory was 94.0 MB in the beginning and 77.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 541.70 ms. Allocated memory is still 121.6 MB. Free memory was 76.7 MB in the beginning and 89.6 MB in the end (delta: -12.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 2.67 ms. Allocated memory is still 121.6 MB. Free memory is still 89.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 51]: 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 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L51] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 67 SDs, 0 SdLazy, 24 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 18:29:11,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:29:11,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:29:11,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:29:11,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:29:11,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:29:11,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:29:11,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:29:11,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:29:11,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:29:11,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:29:11,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:29:11,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:29:11,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:29:11,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:29:11,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:29:11,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:29:11,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:29:11,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:29:11,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:29:11,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:29:11,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:29:11,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:29:11,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:29:11,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:29:11,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:29:11,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:29:11,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:29:11,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:29:11,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:29:11,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:29:11,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:29:11,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:29:11,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:29:11,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:29:11,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:29:11,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:29:11,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:29:11,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:29:11,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:29:11,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:29:11,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 18:29:11,221 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:29:11,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:29:11,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:29:11,222 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:29:11,222 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:29:11,222 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:29:11,222 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:29:11,223 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:29:11,223 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:29:11,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:29:11,223 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:29:11,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:29:11,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:29:11,224 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:29:11,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:29:11,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:29:11,225 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 18:29:11,226 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 18:29:11,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:29:11,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:29:11,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:29:11,226 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-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/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-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan 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 -> a489919c33568e9fb270076fed14bc2a86abb299 [2020-12-09 18:29:11,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:29:11,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:29:11,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:29:11,475 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:29:11,476 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:29:11,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:11,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/1541c043c/45150b8f279047d8befe6153dba57ef6/FLAG0297dac03 [2020-12-09 18:29:11,920 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:29:11,920 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:11,925 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/1541c043c/45150b8f279047d8befe6153dba57ef6/FLAG0297dac03 [2020-12-09 18:29:11,935 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/data/1541c043c/45150b8f279047d8befe6153dba57ef6 [2020-12-09 18:29:11,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:29:11,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:29:11,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:29:11,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:29:11,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:29:11,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:11" (1/1) ... [2020-12-09 18:29:11,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2160a833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:11, skipping insertion in model container [2020-12-09 18:29:11,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:11" (1/1) ... [2020-12-09 18:29:11,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:29:11,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:29:12,081 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2020-12-09 18:29:12,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:29:12,097 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:29:12,118 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2020-12-09 18:29:12,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:29:12,143 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:29:12,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12 WrapperNode [2020-12-09 18:29:12,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:29:12,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:29:12,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:29:12,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:29:12,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:29:12,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:29:12,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:29:12,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:29:12,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... [2020-12-09 18:29:12,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:29:12,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:29:12,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:29:12,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:29:12,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:29:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2020-12-09 18:29:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 18:29:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:29:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-12-09 18:29:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:29:12,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:29:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 18:29:14,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:29:14,900 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 18:29:14,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:14 BoogieIcfgContainer [2020-12-09 18:29:14,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:29:14,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:29:14,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:29:14,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:29:14,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:29:11" (1/3) ... [2020-12-09 18:29:14,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4074df98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:14, skipping insertion in model container [2020-12-09 18:29:14,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:12" (2/3) ... [2020-12-09 18:29:14,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4074df98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:29:14, skipping insertion in model container [2020-12-09 18:29:14,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:14" (3/3) ... [2020-12-09 18:29:14,906 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2020-12-09 18:29:14,915 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:29:14,918 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:29:14,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:29:14,941 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:29:14,941 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:29:14,941 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:29:14,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:29:14,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:29:14,941 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:29:14,942 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:29:14,942 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:29:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-12-09 18:29:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 18:29:14,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:14,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:14,954 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2020-12-09 18:29:14,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:29:14,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126060833] [2020-12-09 18:29:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 18:29:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:29:15,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:29:15,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:29:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:29:15,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:29:15,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126060833] [2020-12-09 18:29:15,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:29:15,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:29:15,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582673638] [2020-12-09 18:29:15,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:29:15,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:29:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:29:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:29:15,314 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-12-09 18:29:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:29:17,495 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-12-09 18:29:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:29:17,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-09 18:29:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:29:17,502 INFO L225 Difference]: With dead ends: 33 [2020-12-09 18:29:17,503 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 18:29:17,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:29:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 18:29:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-12-09 18:29:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 18:29:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-12-09 18:29:17,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2020-12-09 18:29:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:29:17,527 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-12-09 18:29:17,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:29:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-12-09 18:29:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:29:17,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:17,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:17,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 18:29:17,728 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2020-12-09 18:29:17,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:29:17,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836544589] [2020-12-09 18:29:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 18:29:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:29:18,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:29:18,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:29:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:29:18,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:29:18,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836544589] [2020-12-09 18:29:18,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:29:18,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:29:18,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303884814] [2020-12-09 18:29:18,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:29:18,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:29:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:29:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:29:18,037 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2020-12-09 18:29:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:29:20,205 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-12-09 18:29:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:29:20,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 18:29:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:29:20,206 INFO L225 Difference]: With dead ends: 21 [2020-12-09 18:29:20,206 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 18:29:20,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:29:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 18:29:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 18:29:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 18:29:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 18:29:20,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2020-12-09 18:29:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:29:20,211 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 18:29:20,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:29:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 18:29:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:29:20,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:29:20,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:29:20,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 18:29:20,414 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:29:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:29:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2020-12-09 18:29:20,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:29:20,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822126242] [2020-12-09 18:29:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 18:29:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:29:20,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 18:29:20,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:29:21,381 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-09 18:29:21,445 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:29:21,446 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 90 [2020-12-09 18:29:21,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:29:21,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:29:21,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 18:29:21,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:29:21,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:29:21,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 18:29:21,462 INFO L547 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 18:30:00,577 WARN L197 SmtUtils]: Spent 39.11 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-09 18:30:00,578 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-09 18:30:00,588 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 18:30:00,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:85 [2020-12-09 18:30:02,631 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~main__z~0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))))))) is different from false [2020-12-09 18:30:08,743 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0)))) is different from false [2020-12-09 18:30:10,761 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.geq ULTIMATE.start_main_~main__t~0 .cse0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0)))) is different from true [2020-12-09 18:30:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:30:22,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:30:22,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822126242] [2020-12-09 18:30:22,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:30:22,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 18:30:22,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605908980] [2020-12-09 18:30:22,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 18:30:22,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:30:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 18:30:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2020-12-09 18:30:22,952 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2020-12-09 18:30:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:30:25,613 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-12-09 18:30:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 18:30:25,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-12-09 18:30:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:30:25,617 INFO L225 Difference]: With dead ends: 30 [2020-12-09 18:30:25,617 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 18:30:25,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2020-12-09 18:30:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 18:30:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-12-09 18:30:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-09 18:30:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-12-09 18:30:25,622 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2020-12-09 18:30:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:30:25,622 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-12-09 18:30:25,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 18:30:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-12-09 18:30:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:30:25,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:30:25,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:30:25,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 18:30:25,824 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:30:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:30:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2020-12-09 18:30:25,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:30:25,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592615129] [2020-12-09 18:30:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 18:30:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:30:26,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:30:26,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:30:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:30:26,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:30:26,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592615129] [2020-12-09 18:30:26,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:30:26,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:30:26,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831766773] [2020-12-09 18:30:26,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:30:26,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:30:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:30:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:30:26,112 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-12-09 18:30:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:30:26,145 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-12-09 18:30:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:30:26,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-09 18:30:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:30:26,146 INFO L225 Difference]: With dead ends: 32 [2020-12-09 18:30:26,146 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 18:30:26,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:30:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 18:30:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-09 18:30:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 18:30:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-12-09 18:30:26,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2020-12-09 18:30:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:30:26,149 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-12-09 18:30:26,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:30:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-12-09 18:30:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 18:30:26,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:30:26,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:30:26,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 18:30:26,351 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:30:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:30:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2020-12-09 18:30:26,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:30:26,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293465242] [2020-12-09 18:30:26,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 18:30:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:30:27,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 18:30:27,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:30:27,831 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-09 18:30:27,858 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:30:27,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 90 [2020-12-09 18:30:27,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:30:27,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:30:27,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 18:30:27,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:30:27,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:30:27,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 18:30:27,869 INFO L547 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 18:31:14,024 WARN L197 SmtUtils]: Spent 46.15 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-09 18:31:14,025 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-09 18:31:14,029 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 18:31:14,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:85 [2020-12-09 18:31:16,072 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (fp.leq ULTIMATE.start_main_~main__t~0 .cse0) (fp.geq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))) is different from false [2020-12-09 18:31:18,129 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (fp.leq ULTIMATE.start_main_~main__t~0 .cse0) (fp.geq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))) is different from false [2020-12-09 18:31:24,358 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (fp.geq .cse0 (_ +zero 11 53)))))) is different from false [2020-12-09 18:31:26,391 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (fp.geq .cse0 (_ +zero 11 53)))))) is different from true [2020-12-09 18:31:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:38,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:31:38,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293465242] [2020-12-09 18:31:38,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:31:38,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 18:31:38,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142964041] [2020-12-09 18:31:38,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 18:31:38,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:31:38,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 18:31:38,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2020-12-09 18:31:38,680 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 12 states. [2020-12-09 18:31:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:31:41,768 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-12-09 18:31:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 18:31:41,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2020-12-09 18:31:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:31:41,772 INFO L225 Difference]: With dead ends: 25 [2020-12-09 18:31:41,772 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 18:31:41,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2020-12-09 18:31:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 18:31:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 18:31:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 18:31:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-12-09 18:31:41,775 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2020-12-09 18:31:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:31:41,775 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-12-09 18:31:41,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 18:31:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-12-09 18:31:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 18:31:41,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:31:41,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:31:41,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 18:31:41,977 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:31:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:31:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1048715671, now seen corresponding path program 1 times [2020-12-09 18:31:41,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:31:41,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253952978] [2020-12-09 18:31:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 18:31:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:31:42,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 18:31:42,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:31:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:42,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:31:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:42,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253952978] [2020-12-09 18:31:42,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514739949] [2020-12-09 18:31:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt [2020-12-09 18:31:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:31:42,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 18:31:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:31:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:42,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:31:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:42,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961127707] [2020-12-09 18:31:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:31:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:31:43,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:31:43,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:31:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:43,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:31:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:31:43,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 18:31:43,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2020-12-09 18:31:43,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616174639] [2020-12-09 18:31:43,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 18:31:43,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:31:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 18:31:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:31:43,085 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2020-12-09 18:31:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:31:45,369 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-09 18:31:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:31:45,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 18:31:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:31:45,371 INFO L225 Difference]: With dead ends: 33 [2020-12-09 18:31:45,371 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 18:31:45,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:31:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 18:31:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-12-09 18:31:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-09 18:31:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-12-09 18:31:45,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2020-12-09 18:31:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:31:45,376 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-12-09 18:31:45,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 18:31:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-12-09 18:31:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 18:31:45,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:31:45,376 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:31:45,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt [2020-12-09 18:31:45,979 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:31:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:31:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash -673335440, now seen corresponding path program 1 times [2020-12-09 18:31:45,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:31:45,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853479610] [2020-12-09 18:31:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 18:31:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:31:46,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 18:31:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:31:46,946 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-09 18:31:47,214 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-12-09 18:31:47,400 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-09 18:31:47,682 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2020-12-09 18:31:47,733 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:31:47,733 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 121 [2020-12-09 18:31:47,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 18:31:47,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:31:47,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:31:47,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:31:47,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:31:47,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:31:47,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 18:31:47,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:31:47,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:31:47,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:31:47,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:31:47,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:31:47,749 INFO L547 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 18:32:20,093 WARN L197 SmtUtils]: Spent 32.34 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-09 18:32:20,094 INFO L625 ElimStorePlain]: treesize reduction 12, result has 90.3 percent of original size [2020-12-09 18:32:20,099 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-12-09 18:32:20,099 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:228, output treesize:108 [2020-12-09 18:32:22,143 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (= .cse0 .cse2) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (= .cse3 .cse2)))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_7 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))))) is different from false [2020-12-09 18:32:28,238 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (= .cse2 .cse3) (fp.leq ULTIMATE.start_main_~main__t~0 .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53)))))) is different from false [2020-12-09 18:32:30,252 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (= .cse2 .cse3) (fp.leq ULTIMATE.start_main_~main__t~0 .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53)))))) is different from true [2020-12-09 18:32:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:32:42,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:32:45,503 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2020-12-09 18:32:47,553 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2020-12-09 18:32:49,604 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from false [2020-12-09 18:32:51,653 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|))) is different from true [2020-12-09 18:32:53,706 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2020-12-09 18:32:55,754 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2020-12-09 18:32:57,805 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1))))) is different from false [2020-12-09 18:32:59,854 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1))))) is different from true [2020-12-09 18:33:01,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse4 (let ((.cse6 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2 (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))))) is different from false [2020-12-09 18:33:03,958 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse4 (let ((.cse6 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2 (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))))) is different from true [2020-12-09 18:33:06,008 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2020-12-09 18:33:08,058 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2020-12-09 18:33:10,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2020-12-09 18:33:12,161 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2020-12-09 18:33:14,221 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from true [2020-12-09 18:33:14,279 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:33:14,280 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 276 treesize of output 148 [2020-12-09 18:33:14,282 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,283 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,283 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:33:14,285 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,285 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 18:33:14,286 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:33:14,289 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,290 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,290 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:33:14,292 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:33:14,292 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 18:33:14,293 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:33:14,294 INFO L547 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 18:34:41,788 WARN L197 SmtUtils]: Spent 1.46 m on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-09 18:34:41,789 INFO L625 ElimStorePlain]: treesize reduction 33, result has 77.7 percent of original size [2020-12-09 18:34:41,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-12-09 18:34:41,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:276, output treesize:112 [2020-12-09 18:34:43,810 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_16 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16))))) (forall ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) .cse0)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse3 .cse2)) (not (= .cse1 .cse3))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) is different from false [2020-12-09 18:34:45,858 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_16 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16))))) (forall ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) .cse0)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse1) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))) (_ +zero 11 53)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse3 .cse2)) (not (= .cse1 .cse3))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) is different from true [2020-12-09 18:34:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 18:34:45,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853479610] [2020-12-09 18:34:45,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1523104314] [2020-12-09 18:34:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 18:34:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:34:46,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 18:34:46,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:34:46,844 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:34:46,844 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 121 [2020-12-09 18:34:46,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 18:34:46,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:34:46,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:34:46,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:34:46,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:34:46,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:34:46,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 18:34:46,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:34:46,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:34:46,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:34:46,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:34:46,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:34:46,857 INFO L547 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 18:35:40,591 WARN L197 SmtUtils]: Spent 53.73 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-09 18:35:40,592 INFO L625 ElimStorePlain]: treesize reduction 12, result has 90.3 percent of original size [2020-12-09 18:35:40,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-12-09 18:35:40,597 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:228, output treesize:108 [2020-12-09 18:35:42,643 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_21 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) .cse0) (= c_ULTIMATE.start_main_~main__z~0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse0) (= .cse1 .cse2) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (= .cse3 .cse2)))) (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))))) is different from false [2020-12-09 18:35:48,748 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_21 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub roundNearestTiesToEven .cse3 .cse1))) (_ +zero 11 53))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse2))))) is different from false [2020-12-09 18:35:50,763 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_21 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub roundNearestTiesToEven .cse3 .cse1))) (_ +zero 11 53))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse2))))) is different from true [2020-12-09 18:36:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:36:02,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:36:04,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.geq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from false [2020-12-09 18:36:07,012 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.geq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (_ +zero 11 53)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.leq c_ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from true [2020-12-09 18:36:07,072 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 18:36:07,073 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 276 treesize of output 148 [2020-12-09 18:36:07,075 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,075 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,076 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:36:07,077 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,078 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 18:36:07,078 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:36:07,082 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,082 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,083 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:36:07,085 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 18:36:07,086 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 18:36:07,087 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 18:36:07,089 INFO L547 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 18:37:40,568 WARN L197 SmtUtils]: Spent 1.56 m on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-09 18:37:40,569 INFO L625 ElimStorePlain]: treesize reduction 33, result has 77.7 percent of original size [2020-12-09 18:37:40,572 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-12-09 18:37:40,572 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:276, output treesize:112 [2020-12-09 18:37:42,590 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_25 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25))))) (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet7_5| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse0)) (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse1) (not (= .cse2 .cse3)) (not (= .cse1 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_5| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))) (_ +zero 11 53))))) (forall ((v_arrayElimCell_23 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))))) is different from false [2020-12-09 18:37:44,642 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_25 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25))))) (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet7_5| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse0)) (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse1) (not (= .cse2 .cse3)) (not (= .cse1 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_5| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))) (_ +zero 11 53))))) (forall ((v_arrayElimCell_23 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))))) is different from true [2020-12-09 18:37:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 18:37:44,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55792028] [2020-12-09 18:37:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbe21b4d-ed0c-4b55-bde0-b05c5046b148/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:37:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:37:53,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:38:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:38:07,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:38:08,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 18:38:08,440 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1853479610] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [55792028] failed with TRACE_FEASIBLE at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:38:08,450 INFO L168 Benchmark]: Toolchain (without parser) took 536511.09 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 48.8 MB in the beginning and 40.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 23.6 MB. Max. memory is 16.1 GB. [2020-12-09 18:38:08,450 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 65.0 MB. Free memory is still 48.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:38:08,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.27 ms. Allocated memory is still 65.0 MB. Free memory was 48.6 MB in the beginning and 49.3 MB in the end (delta: -717.2 kB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:38:08,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 65.0 MB. Free memory was 49.3 MB in the beginning and 47.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:38:08,452 INFO L168 Benchmark]: Boogie Preprocessor took 30.26 ms. Allocated memory is still 65.0 MB. Free memory was 47.7 MB in the beginning and 46.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:38:08,453 INFO L168 Benchmark]: RCFGBuilder took 2685.14 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 46.2 MB in the beginning and 64.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:38:08,453 INFO L168 Benchmark]: TraceAbstraction took 533545.94 ms. Allocated memory is still 81.8 MB. Free memory was 63.6 MB in the beginning and 40.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:38:08,456 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.12 ms. Allocated memory is still 65.0 MB. Free memory is still 48.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 205.27 ms. Allocated memory is still 65.0 MB. Free memory was 48.6 MB in the beginning and 49.3 MB in the end (delta: -717.2 kB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 65.0 MB. Free memory was 49.3 MB in the beginning and 47.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.26 ms. Allocated memory is still 65.0 MB. Free memory was 47.7 MB in the beginning and 46.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2685.14 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 46.2 MB in the beginning and 64.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 533545.94 ms. Allocated memory is still 81.8 MB. Free memory was 63.6 MB in the beginning and 40.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1853479610] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [55792028] failed with TRACE_FEASIBLE de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1853479610] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [55792028] failed with TRACE_FEASIBLE: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...