./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+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_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 c8d3317e3047c2db32c19325f4f8584f449f6320 ................................................................................................................................................................................................................................................................................................................................................................... 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 c8d3317e3047c2db32c19325f4f8584f449f6320 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1351933540] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [870203423] failed with TRACE_FEASIBLE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:31:09,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:31:09,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:31:09,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:31:09,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:31:09,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:31:09,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:31:09,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:31:09,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:31:09,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:31:09,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:31:09,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:31:09,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:31:09,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:31:09,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:31:09,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:31:09,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:31:09,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:31:09,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:31:09,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:31:09,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:31:09,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:31:09,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:31:09,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:31:09,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:31:09,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:31:09,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:31:09,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:31:09,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:31:09,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:31:09,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:31:09,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:31:09,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:31:09,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:31:09,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:31:09,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:31:09,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:31:09,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:31:09,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:31:09,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:31:09,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:31:09,632 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 17:31:09,650 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:31:09,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:31:09,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:31:09,651 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:31:09,651 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:31:09,651 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:31:09,651 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:31:09,651 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:31:09,651 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:31:09,652 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:31:09,652 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:31:09,652 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:31:09,652 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:31:09,652 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:31:09,652 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:31:09,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:31:09,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:31:09,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:31:09,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:31:09,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:31:09,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:31:09,655 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/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_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 -> c8d3317e3047c2db32c19325f4f8584f449f6320 [2020-12-09 17:31:09,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:31:09,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:31:09,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:31:09,870 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:31:09,870 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:31:09,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:09,913 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/06e761ca0/381200dcf6384975bc10d74d644eba63/FLAGf6b727a09 [2020-12-09 17:31:10,271 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:31:10,271 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:10,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/06e761ca0/381200dcf6384975bc10d74d644eba63/FLAGf6b727a09 [2020-12-09 17:31:10,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/06e761ca0/381200dcf6384975bc10d74d644eba63 [2020-12-09 17:31:10,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:31:10,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:31:10,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:10,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:31:10,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:31:10,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370327db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10, skipping insertion in model container [2020-12-09 17:31:10,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:31:10,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:31:10,816 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2020-12-09 17:31:10,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:10,825 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:31:10,839 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2020-12-09 17:31:10,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:10,850 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:31:10,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10 WrapperNode [2020-12-09 17:31:10,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:10,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:10,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:31:10,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:31:10,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:10,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:31:10,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:31:10,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:31:10,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... [2020-12-09 17:31:10,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:31:10,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:31:10,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:31:10,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:31:10,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:31:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 17:31:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:31:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-12-09 17:31:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:31:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:31:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-12-09 17:31:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 17:31:11,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:31:11,173 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 17:31:11,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:11 BoogieIcfgContainer [2020-12-09 17:31:11,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:31:11,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:31:11,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:31:11,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:31:11,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:31:10" (1/3) ... [2020-12-09 17:31:11,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca7a9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:11, skipping insertion in model container [2020-12-09 17:31:11,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:10" (2/3) ... [2020-12-09 17:31:11,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca7a9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:11, skipping insertion in model container [2020-12-09 17:31:11,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:11" (3/3) ... [2020-12-09 17:31:11,181 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:11,191 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:31:11,193 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 17:31:11,200 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 17:31:11,216 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:31:11,217 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:31:11,217 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:31:11,217 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:31:11,217 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:31:11,217 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:31:11,217 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:31:11,217 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:31:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-12-09 17:31:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 17:31:11,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:11,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:11,230 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2020-12-09 17:31:11,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:11,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845859407] [2020-12-09 17:31:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:11,375 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 17:31:11,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845859407] [2020-12-09 17:31:11,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:11,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 17:31:11,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201233869] [2020-12-09 17:31:11,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 17:31:11,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 17:31:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:31:11,395 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2020-12-09 17:31:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:11,454 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-12-09 17:31:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 17:31:11,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 17:31:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:11,463 INFO L225 Difference]: With dead ends: 26 [2020-12-09 17:31:11,464 INFO L226 Difference]: Without dead ends: 14 [2020-12-09 17:31:11,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 17:31:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-09 17:31:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-09 17:31:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-09 17:31:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-12-09 17:31:11,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2020-12-09 17:31:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:11,497 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-12-09 17:31:11,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 17:31:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-12-09 17:31:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 17:31:11,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:11,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:11,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:31:11,498 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1409346054, now seen corresponding path program 1 times [2020-12-09 17:31:11,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:11,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968157575] [2020-12-09 17:31:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:11,539 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 17:31:11,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968157575] [2020-12-09 17:31:11,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:11,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:31:11,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922006051] [2020-12-09 17:31:11,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:11,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:11,542 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2020-12-09 17:31:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:11,555 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-12-09 17:31:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:11,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 17:31:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:11,556 INFO L225 Difference]: With dead ends: 32 [2020-12-09 17:31:11,556 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 17:31:11,557 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 17:31:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 17:31:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2020-12-09 17:31:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-12-09 17:31:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-12-09 17:31:11,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2020-12-09 17:31:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:11,561 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-12-09 17:31:11,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-12-09 17:31:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 17:31:11,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:11,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:11,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 17:31:11,562 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2020-12-09 17:31:11,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:11,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092059381] [2020-12-09 17:31:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:31:11,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:31:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:31:11,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:31:11,610 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 17:31:11,610 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 17:31:11,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 17:31:11,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:31:11 BoogieIcfgContainer [2020-12-09 17:31:11,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:31:11,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:31:11,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:31:11,634 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:31:11,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:11" (3/4) ... [2020-12-09 17:31:11,636 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 17:31:11,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:31:11,638 INFO L168 Benchmark]: Toolchain (without parser) took 946.06 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 42.5 MB in the beginning and 68.0 MB in the end (delta: -25.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:31:11,639 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 81.8 MB. Free memory is still 58.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:31:11,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.46 ms. Allocated memory is still 81.8 MB. Free memory was 42.3 MB in the beginning and 52.1 MB in the end (delta: -9.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-12-09 17:31:11,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 81.8 MB. Free memory was 52.1 MB in the beginning and 50.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:31:11,640 INFO L168 Benchmark]: Boogie Preprocessor took 20.15 ms. Allocated memory is still 81.8 MB. Free memory was 50.2 MB in the beginning and 49.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:31:11,641 INFO L168 Benchmark]: RCFGBuilder took 271.73 ms. Allocated memory is still 81.8 MB. Free memory was 48.9 MB in the beginning and 52.1 MB in the end (delta: -3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 17:31:11,641 INFO L168 Benchmark]: TraceAbstraction took 457.29 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 51.6 MB in the beginning and 68.6 MB in the end (delta: -17.0 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:31:11,641 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 100.7 MB. Free memory was 68.6 MB in the beginning and 68.0 MB in the end (delta: 603.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:31:11,644 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.17 ms. Allocated memory is still 81.8 MB. Free memory is still 58.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 158.46 ms. Allocated memory is still 81.8 MB. Free memory was 42.3 MB in the beginning and 52.1 MB in the end (delta: -9.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 81.8 MB. Free memory was 52.1 MB in the beginning and 50.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.15 ms. Allocated memory is still 81.8 MB. Free memory was 50.2 MB in the beginning and 49.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 271.73 ms. Allocated memory is still 81.8 MB. Free memory was 48.9 MB in the beginning and 52.1 MB in the end (delta: -3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 457.29 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 51.6 MB in the beginning and 68.6 MB in the end (delta: -17.0 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. * Witness Printer took 3.13 ms. Allocated memory is still 100.7 MB. Free memory was 68.6 MB in the beginning and 68.0 MB in the end (delta: 603.2 kB). 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 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __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_125=0, __return_main=0] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __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_125=0, __return_main=0] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0] [L51] reach_error() VAL [__return_125=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 35 SDslu, 47 SDs, 0 SdLazy, 19 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s 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 17:31:13,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:31:13,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:31:13,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:31:13,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:31:13,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:31:13,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:31:13,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:31:13,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:31:13,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:31:13,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:31:13,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:31:13,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:31:13,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:31:13,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:31:13,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:31:13,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:31:13,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:31:13,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:31:13,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:31:13,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:31:13,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:31:13,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:31:13,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:31:13,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:31:13,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:31:13,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:31:13,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:31:13,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:31:13,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:31:13,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:31:13,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:31:13,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:31:13,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:31:13,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:31:13,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:31:13,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:31:13,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:31:13,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:31:13,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:31:13,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:31:13,355 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 17:31:13,380 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:31:13,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:31:13,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:31:13,381 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:31:13,382 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:31:13,382 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:31:13,382 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:31:13,382 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:31:13,382 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:31:13,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:31:13,383 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:31:13,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:31:13,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:31:13,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 17:31:13,385 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 17:31:13,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:31:13,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:31:13,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:31:13,386 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/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_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 -> c8d3317e3047c2db32c19325f4f8584f449f6320 [2020-12-09 17:31:13,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:31:13,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:31:13,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:31:13,637 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:31:13,637 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:31:13,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:13,681 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/9e3d99eea/2c487af635a14039a0d12b3e3ef3aeaf/FLAG842640b56 [2020-12-09 17:31:13,999 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:31:13,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:14,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/9e3d99eea/2c487af635a14039a0d12b3e3ef3aeaf/FLAG842640b56 [2020-12-09 17:31:14,414 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/data/9e3d99eea/2c487af635a14039a0d12b3e3ef3aeaf [2020-12-09 17:31:14,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:31:14,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:31:14,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:14,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:31:14,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:31:14,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1953d093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14, skipping insertion in model container [2020-12-09 17:31:14,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:31:14,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:31:14,566 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2020-12-09 17:31:14,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:14,581 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:31:14,599 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_20e3dee2-338d-4292-9dc6-49e64a67f36f/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2020-12-09 17:31:14,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:14,619 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:31:14,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14 WrapperNode [2020-12-09 17:31:14,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:14,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:14,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:31:14,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:31:14,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:14,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:31:14,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:31:14,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:31:14,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... [2020-12-09 17:31:14,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:31:14,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:31:14,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:31:14,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:31:14,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:31:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2020-12-09 17:31:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 17:31:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:31:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-12-09 17:31:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:31:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:31:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 17:31:17,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:31:17,335 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 17:31:17,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:17 BoogieIcfgContainer [2020-12-09 17:31:17,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:31:17,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:31:17,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:31:17,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:31:17,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:31:14" (1/3) ... [2020-12-09 17:31:17,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fbf81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:17, skipping insertion in model container [2020-12-09 17:31:17,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:14" (2/3) ... [2020-12-09 17:31:17,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fbf81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:17, skipping insertion in model container [2020-12-09 17:31:17,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:17" (3/3) ... [2020-12-09 17:31:17,341 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2020-12-09 17:31:17,350 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:31:17,352 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 17:31:17,359 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 17:31:17,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:31:17,374 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:31:17,374 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:31:17,374 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:31:17,374 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:31:17,374 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:31:17,374 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:31:17,374 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:31:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-12-09 17:31:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 17:31:17,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:17,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:17,385 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2020-12-09 17:31:17,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:31:17,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847440167] [2020-12-09 17:31:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:31:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:17,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 17:31:17,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:31:17,720 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 17:31:17,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:31:17,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847440167] [2020-12-09 17:31:17,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:17,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:31:17,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519980703] [2020-12-09 17:31:17,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:17,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:31:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:17,736 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-12-09 17:31:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:21,769 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-12-09 17:31:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:21,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-09 17:31:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:21,805 INFO L225 Difference]: With dead ends: 42 [2020-12-09 17:31:21,805 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 17:31:21,807 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 17:31:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 17:31:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2020-12-09 17:31:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-09 17:31:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-12-09 17:31:21,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2020-12-09 17:31:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:21,827 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-12-09 17:31:21,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-12-09 17:31:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 17:31:21,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:21,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:22,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 17:31:22,030 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2020-12-09 17:31:22,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:31:22,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892716033] [2020-12-09 17:31:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:31:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:22,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 17:31:22,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:31:22,368 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 17:31:22,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:31:22,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892716033] [2020-12-09 17:31:22,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:22,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:31:22,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893684618] [2020-12-09 17:31:22,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:31:22,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:31:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:31:22,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:31:22,371 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2020-12-09 17:31:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:24,541 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-12-09 17:31:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:31:24,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 17:31:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:24,542 INFO L225 Difference]: With dead ends: 20 [2020-12-09 17:31:24,542 INFO L226 Difference]: Without dead ends: 16 [2020-12-09 17:31:24,542 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 17:31:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-09 17:31:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-09 17:31:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-09 17:31:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-12-09 17:31:24,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2020-12-09 17:31:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:24,545 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-12-09 17:31:24,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:31:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-12-09 17:31:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 17:31:24,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:24,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:24,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 17:31:24,748 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2020-12-09 17:31:24,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:31:24,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956635293] [2020-12-09 17:31:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:31:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:25,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 17:31:25,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:31:25,782 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-09 17:31:25,832 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:31:25,832 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 17:31:25,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:31:25,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:31:25,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 17:31:25,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:31:25,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:31:25,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 17:31:25,849 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 17:32:00,599 WARN L197 SmtUtils]: Spent 34.75 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-09 17:32:00,600 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-09 17:32:00,610 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 17:32:00,611 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:85 [2020-12-09 17:32:02,678 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 17:32:08,790 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 17:32:10,809 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 17:32:22,992 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 17:32:22,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:32:22,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956635293] [2020-12-09 17:32:22,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:22,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 17:32:22,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175112230] [2020-12-09 17:32:22,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 17:32:22,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:32:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 17:32:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2020-12-09 17:32:22,994 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 11 states. [2020-12-09 17:32:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:25,637 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-12-09 17:32:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 17:32:25,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-12-09 17:32:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:25,641 INFO L225 Difference]: With dead ends: 24 [2020-12-09 17:32:25,641 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 17:32:25,642 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 17:32:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 17:32:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-09 17:32:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 17:32:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-12-09 17:32:25,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2020-12-09 17:32:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:25,645 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-12-09 17:32:25,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 17:32:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-12-09 17:32:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 17:32:25,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:25,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:25,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 17:32:25,847 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2020-12-09 17:32:25,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:32:25,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898445977] [2020-12-09 17:32:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:32:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:26,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 17:32:26,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:32:27,127 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-09 17:32:27,156 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:32:27,157 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 17:32:27,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:32:27,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:32:27,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 17:32:27,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:32:27,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:32:27,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 17:32:27,171 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 17:33:11,028 WARN L197 SmtUtils]: Spent 43.86 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-09 17:33:11,029 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-09 17:33:11,034 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 17:33:11,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:85 [2020-12-09 17:33:13,073 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 17:33:15,130 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 17:33:21,332 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 17:33:23,362 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 17:33:35,648 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 17:33:35,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:33:35,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898445977] [2020-12-09 17:33:35,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:33:35,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 17:33:35,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499211321] [2020-12-09 17:33:35,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 17:33:35,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:33:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 17:33:35,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2020-12-09 17:33:35,650 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 12 states. [2020-12-09 17:33:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:33:38,593 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-12-09 17:33:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 17:33:38,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2020-12-09 17:33:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:33:38,598 INFO L225 Difference]: With dead ends: 25 [2020-12-09 17:33:38,598 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 17:33:38,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=32, Invalid=48, Unknown=4, NotChecked=48, Total=132 [2020-12-09 17:33:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 17:33:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 17:33:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 17:33:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-12-09 17:33:38,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2020-12-09 17:33:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:33:38,602 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-12-09 17:33:38,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 17:33:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-12-09 17:33:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 17:33:38,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:33:38,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:33:38,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 17:33:38,804 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:33:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:33:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2020-12-09 17:33:38,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:33:38,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750227789] [2020-12-09 17:33:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/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 17:33:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:33:39,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 17:33:39,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:33:39,158 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 17:33:39,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:33:39,200 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 17:33:39,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750227789] [2020-12-09 17:33:39,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [518099638] [2020-12-09 17:33:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt [2020-12-09 17:33:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:33:39,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 17:33:39,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:33:39,618 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 17:33:39,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:33:39,626 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 17:33:39,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438925024] [2020-12-09 17:33:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:33:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:33:39,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 17:33:39,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:33:39,871 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 17:33:39,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:33:39,910 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 17:33:39,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 17:33:39,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2020-12-09 17:33:39,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598641525] [2020-12-09 17:33:39,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 17:33:39,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:33:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 17:33:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 17:33:39,912 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2020-12-09 17:33:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:33:42,168 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-09 17:33:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 17:33:42,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 17:33:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:33:42,170 INFO L225 Difference]: With dead ends: 33 [2020-12-09 17:33:42,170 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 17:33:42,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-09 17:33:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 17:33:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-12-09 17:33:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-09 17:33:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-12-09 17:33:42,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2020-12-09 17:33:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:33:42,174 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-12-09 17:33:42,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 17:33:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-12-09 17:33:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 17:33:42,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:33:42,175 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:33:42,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:33:42,778 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:33:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:33:42,779 INFO L82 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2020-12-09 17:33:42,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:33:42,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351933540] [2020-12-09 17:33:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 17:33:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:33:43,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 17:33:43,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:33:44,003 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-12-09 17:33:44,194 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-09 17:33:44,488 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2020-12-09 17:33:44,537 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:33:44,537 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 17:33:44,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:33:44,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:33:44,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:33:44,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:33:44,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:33:44,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 17:33:44,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:33:44,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:33:44,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:33:44,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:33:44,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:33:44,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 17:33:44,550 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 17:34:22,295 WARN L197 SmtUtils]: Spent 37.75 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-09 17:34:22,296 INFO L625 ElimStorePlain]: treesize reduction 12, result has 90.3 percent of original size [2020-12-09 17:34:22,300 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 17:34:22,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:228, output treesize:108 [2020-12-09 17:34:24,353 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 17:34:30,457 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 17:34:32,471 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 17:34:44,592 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 17:34:44,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:34:45,851 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-12-09 17:34:47,899 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 17:34:49,949 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 17:34:52,002 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 17:34:54,055 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 17:34:56,109 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 17:34:58,160 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 17:35:00,211 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 17:35:02,264 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 17:35:04,317 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 17:35:06,369 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 17:35:08,421 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 17:35:10,470 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 17:35:12,526 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 17:35:14,575 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 17:35:16,638 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 17:35:16,690 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:35:16,691 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 17:35:16,693 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,693 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,694 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:35:16,695 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:35:16,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:35:16,699 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,700 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,700 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:35:16,701 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:35:16,702 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:35:16,703 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:35:16,704 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 17:36:45,252 WARN L197 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-09 17:36:45,253 INFO L625 ElimStorePlain]: treesize reduction 33, result has 77.7 percent of original size [2020-12-09 17:36:45,256 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 17:36:45,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:276, output treesize:112 [2020-12-09 17:36:47,271 WARN L838 $PredicateComparison]: unable to prove that (or (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_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse1 .cse2)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (_ +zero 11 53)) (not (= .cse2 .cse3))))) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)))))) is different from false [2020-12-09 17:36:49,321 WARN L860 $PredicateComparison]: unable to prove that (or (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_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse1 .cse2)) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (_ +zero 11 53)) (not (= .cse2 .cse3))))) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)))))) is different from true [2020-12-09 17:36:49,323 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 17:36:49,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351933540] [2020-12-09 17:36:49,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1673118463] [2020-12-09 17:36:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt [2020-12-09 17:36:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:36:50,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 17:36:50,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:36:50,270 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:36:50,270 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 17:36:50,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:36:50,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:36:50,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:36:50,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:36:50,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:36:50,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 17:36:50,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:36:50,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:36:50,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:36:50,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:36:50,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 17:36:50,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 17:36:50,283 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 17:37:41,141 WARN L197 SmtUtils]: Spent 50.86 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-09 17:37:41,142 INFO L625 ElimStorePlain]: treesize reduction 12, result has 90.3 percent of original size [2020-12-09 17:37:41,147 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 17:37:41,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:228, output treesize:108 [2020-12-09 17:37:43,191 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 17:37:49,290 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 17:37:51,304 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 17:38:03,428 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 17:38:03,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:38:05,496 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 17:38:07,548 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 17:38:07,606 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:38:07,607 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 17:38:07,609 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,609 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:38:07,610 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:38:07,611 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,612 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,612 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:38:07,615 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,616 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:38:07,616 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:38:07,618 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,619 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:38:07,620 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 17:38:07,621 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 17:39:35,635 WARN L197 SmtUtils]: Spent 1.47 m on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-09 17:39:35,635 INFO L625 ElimStorePlain]: treesize reduction 33, result has 77.7 percent of original size [2020-12-09 17:39:35,639 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 17:39:35,639 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:276, output treesize:112 [2020-12-09 17:39:37,656 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_23 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet7_5| (_ FloatingPoint 8 24)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_5| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= .cse0 .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse4) (not (= .cse4 .cse2)) (not (fp.geq |v_ULTIMATE.start_main_#t~nondet7_5| .cse3)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))))))) is different from false [2020-12-09 17:39:39,711 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_23 (_ BitVec 32))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet7_5| (_ FloatingPoint 8 24)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_5| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= .cse0 .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (fp.leq |v_ULTIMATE.start_main_#t~nondet7_5| .cse4) (not (= .cse4 .cse2)) (not (fp.geq |v_ULTIMATE.start_main_#t~nondet7_5| .cse3)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))))))) is different from true [2020-12-09 17:39:39,713 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 17:39:39,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870203423] [2020-12-09 17:39:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e3dee2-338d-4292-9dc6-49e64a67f36f/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:39:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:39:54,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:40:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:40:10,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:40:11,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:40:11,492 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1351933540] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [870203423] 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 17:40:11,500 INFO L168 Benchmark]: Toolchain (without parser) took 537082.18 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 36.4 MB in the beginning and 51.7 MB in the end (delta: -15.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 16.1 GB. [2020-12-09 17:40:11,500 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:40:11,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.07 ms. Allocated memory is still 56.6 MB. Free memory was 36.1 MB in the beginning and 40.3 MB in the end (delta: -4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 17:40:11,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.59 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 40.3 MB in the beginning and 56.7 MB in the end (delta: -16.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:40:11,501 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 73.4 MB. Free memory was 56.7 MB in the beginning and 55.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:40:11,502 INFO L168 Benchmark]: RCFGBuilder took 2645.18 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 55.6 MB in the end (delta: -240.6 kB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2020-12-09 17:40:11,502 INFO L168 Benchmark]: TraceAbstraction took 534161.15 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 51.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:40:11,505 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.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 201.07 ms. Allocated memory is still 56.6 MB. Free memory was 36.1 MB in the beginning and 40.3 MB in the end (delta: -4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.59 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 40.3 MB in the beginning and 56.7 MB in the end (delta: -16.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 73.4 MB. Free memory was 56.7 MB in the beginning and 55.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2645.18 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 55.6 MB in the end (delta: -240.6 kB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 534161.15 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 51.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1351933540] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [870203423] failed with TRACE_FEASIBLE de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1351933540] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [870203423] 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...