./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P --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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 22:47:15,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 22:47:15,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 22:47:15,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 22:47:15,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 22:47:15,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 22:47:15,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 22:47:15,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 22:47:15,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 22:47:15,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 22:47:15,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 22:47:15,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 22:47:15,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 22:47:15,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 22:47:15,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 22:47:15,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 22:47:15,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 22:47:15,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 22:47:15,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 22:47:15,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 22:47:15,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 22:47:15,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 22:47:15,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 22:47:15,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 22:47:15,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 22:47:15,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 22:47:15,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 22:47:15,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 22:47:15,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 22:47:15,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 22:47:15,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 22:47:15,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 22:47:15,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 22:47:15,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 22:47:15,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 22:47:15,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 22:47:15,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 22:47:15,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 22:47:15,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 22:47:15,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 22:47:15,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 22:47:15,604 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 22:47:15,646 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 22:47:15,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 22:47:15,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 22:47:15,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 22:47:15,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 22:47:15,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 22:47:15,648 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 22:47:15,648 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 22:47:15,648 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 22:47:15,648 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 22:47:15,649 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 22:47:15,649 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 22:47:15,649 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 22:47:15,649 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 22:47:15,649 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 22:47:15,649 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 22:47:15,650 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 22:47:15,650 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 22:47:15,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 22:47:15,651 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 22:47:15,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 22:47:15,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 22:47:15,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 22:47:15,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 22:47:15,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 22:47:15,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 22:47:15,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 22:47:15,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:15,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 22:47:15,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 22:47:15,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 22:47:15,654 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 22:47:15,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 22:47:15,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 22:47:15,654 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 22:47:15,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 22:47:15,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_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2021-11-20 22:47:15,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 22:47:15,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 22:47:15,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 22:47:16,000 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 22:47:16,003 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 22:47:16,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:16,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/813a07630/e33ba8a117c74e56954a27af02e2ea49/FLAG650448248 [2021-11-20 22:47:16,504 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 22:47:16,504 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:16,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/813a07630/e33ba8a117c74e56954a27af02e2ea49/FLAG650448248 [2021-11-20 22:47:16,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/813a07630/e33ba8a117c74e56954a27af02e2ea49 [2021-11-20 22:47:16,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 22:47:16,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 22:47:16,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:16,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 22:47:16,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 22:47:16,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:16" (1/1) ... [2021-11-20 22:47:16,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5c6622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:16, skipping insertion in model container [2021-11-20 22:47:16,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:16" (1/1) ... [2021-11-20 22:47:16,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 22:47:16,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 22:47:17,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-20 22:47:17,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:17,117 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 22:47:17,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-20 22:47:17,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:17,167 INFO L208 MainTranslator]: Completed translation [2021-11-20 22:47:17,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17 WrapperNode [2021-11-20 22:47:17,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:17,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:17,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 22:47:17,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 22:47:17,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,215 INFO L137 Inliner]: procedures = 18, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 131 [2021-11-20 22:47:17,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:17,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 22:47:17,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 22:47:17,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 22:47:17,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 22:47:17,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 22:47:17,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 22:47:17,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 22:47:17,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2021-11-20 22:47:17,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 22:47:17,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 22:47:17,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 22:47:17,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 22:47:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-20 22:47:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 22:47:17,458 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 22:47:17,460 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 22:47:17,653 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 22:47:17,666 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 22:47:17,666 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 22:47:17,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:17 BoogieIcfgContainer [2021-11-20 22:47:17,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 22:47:17,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 22:47:17,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 22:47:17,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 22:47:17,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:16" (1/3) ... [2021-11-20 22:47:17,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62169791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:17, skipping insertion in model container [2021-11-20 22:47:17,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (2/3) ... [2021-11-20 22:47:17,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62169791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:17, skipping insertion in model container [2021-11-20 22:47:17,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:17" (3/3) ... [2021-11-20 22:47:17,677 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:17,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 22:47:17,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 22:47:17,731 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 22:47:17,738 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 22:47:17,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 22:47:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 22:47:17,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:17,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:17,762 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:17,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2021-11-20 22:47:17,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:17,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656709874] [2021-11-20 22:47:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:17,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:18,078 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656709874] [2021-11-20 22:47:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656709874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:18,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:18,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 22:47:18,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320726847] [2021-11-20 22:47:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:18,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 22:47:18,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 22:47:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 22:47:18,122 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:18,214 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-11-20 22:47:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 22:47:18,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-20 22:47:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:18,225 INFO L225 Difference]: With dead ends: 44 [2021-11-20 22:47:18,225 INFO L226 Difference]: Without dead ends: 26 [2021-11-20 22:47:18,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 22:47:18,232 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:18,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 22:47:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-20 22:47:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2021-11-20 22:47:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-20 22:47:18,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2021-11-20 22:47:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:18,266 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-20 22:47:18,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-20 22:47:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 22:47:18,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:18,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:18,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 22:47:18,268 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2021-11-20 22:47:18,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:18,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428255589] [2021-11-20 22:47:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:18,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:18,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428255589] [2021-11-20 22:47:18,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428255589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:18,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:18,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 22:47:18,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204291039] [2021-11-20 22:47:18,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:18,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 22:47:18,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 22:47:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 22:47:18,357 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:18,388 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-11-20 22:47:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 22:47:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-20 22:47:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:18,392 INFO L225 Difference]: With dead ends: 33 [2021-11-20 22:47:18,392 INFO L226 Difference]: Without dead ends: 25 [2021-11-20 22:47:18,396 INFO L932 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 [2021-11-20 22:47:18,398 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:18,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 22:47:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-20 22:47:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-20 22:47:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-11-20 22:47:18,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2021-11-20 22:47:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:18,404 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-11-20 22:47:18,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-11-20 22:47:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 22:47:18,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:18,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:18,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 22:47:18,420 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2021-11-20 22:47:18,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243323233] [2021-11-20 22:47:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:18,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 22:47:18,455 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 22:47:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 22:47:18,530 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-20 22:47:18,530 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 22:47:18,531 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 22:47:18,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 22:47:18,548 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-20 22:47:18,551 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 22:47:18,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:18 BoogieIcfgContainer [2021-11-20 22:47:18,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 22:47:18,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 22:47:18,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 22:47:18,603 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 22:47:18,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:17" (3/4) ... [2021-11-20 22:47:18,607 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 22:47:18,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 22:47:18,608 INFO L158 Benchmark]: Toolchain (without parser) took 1707.38ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 74.7MB in the beginning and 129.0MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:18,608 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 115.3MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:18,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.56ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 88.2MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 22:47:18,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 86.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:18,610 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 115.3MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 22:47:18,611 INFO L158 Benchmark]: RCFGBuilder took 405.71ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 73.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 22:47:18,611 INFO L158 Benchmark]: TraceAbstraction took 931.52ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 72.6MB in the beginning and 129.0MB in the end (delta: -56.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:18,612 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 159.4MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:18,615 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.29ms. Allocated memory is still 115.3MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.56ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 88.2MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 86.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 115.3MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.71ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 73.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 931.52ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 72.6MB in the beginning and 129.0MB in the end (delta: -56.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 159.4MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: 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 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] main__t = __VERIFIER_nondet_float() [L22] int main____CPAchecker_TMP_0; [L23] EXPR main__min[0] VAL [__return_main=0, main__max={7:0}, main__min={6:0}, main__min[0]=50, main__org={5:0}, main__slope={4:0}] [L23] COND TRUE main__t >= (main__min[0]) [L25] EXPR main__max[4UL] VAL [__return_main=0, main__max={7:0}, main__max[4UL]=51, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L25] COND TRUE main__t <= (main__max[4UL]) [L27] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={7:0}, main__max[main__i]=49, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L35] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L65] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] [L53] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={7:0}, main__min={6:0}, main__org={5:0}, main__slope={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 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 [2021-11-20 22:47:18,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P --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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 22:47:21,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 22:47:21,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 22:47:21,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 22:47:21,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 22:47:21,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 22:47:21,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 22:47:21,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 22:47:21,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 22:47:21,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 22:47:21,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 22:47:21,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 22:47:21,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 22:47:21,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 22:47:21,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 22:47:21,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 22:47:21,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 22:47:21,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 22:47:21,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 22:47:21,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 22:47:21,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 22:47:21,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 22:47:21,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 22:47:21,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 22:47:21,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 22:47:21,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 22:47:21,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 22:47:21,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 22:47:21,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 22:47:21,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 22:47:21,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 22:47:21,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 22:47:21,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 22:47:21,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 22:47:21,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 22:47:21,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 22:47:21,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 22:47:21,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 22:47:21,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 22:47:21,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 22:47:21,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 22:47:21,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-20 22:47:21,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 22:47:21,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 22:47:21,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 22:47:21,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 22:47:21,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 22:47:21,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 22:47:21,343 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 22:47:21,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 22:47:21,344 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 22:47:21,344 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 22:47:21,345 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 22:47:21,345 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 22:47:21,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 22:47:21,347 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 22:47:21,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 22:47:21,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 22:47:21,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 22:47:21,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 22:47:21,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 22:47:21,348 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 22:47:21,348 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 22:47:21,349 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 22:47:21,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 22:47:21,349 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 22:47:21,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 22:47:21,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 22:47:21,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 22:47:21,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 22:47:21,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:21,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 22:47:21,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 22:47:21,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 22:47:21,351 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-20 22:47:21,352 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 22:47:21,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 22:47:21,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 22:47:21,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 22:47:21,352 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2021-11-20 22:47:21,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 22:47:21,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 22:47:21,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 22:47:21,747 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 22:47:21,748 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 22:47:21,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:21,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/7c099e252/cba54be249554958b0dc1d95b5ea64be/FLAG014b7b127 [2021-11-20 22:47:22,472 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 22:47:22,473 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:22,478 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/7c099e252/cba54be249554958b0dc1d95b5ea64be/FLAG014b7b127 [2021-11-20 22:47:22,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/data/7c099e252/cba54be249554958b0dc1d95b5ea64be [2021-11-20 22:47:22,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 22:47:22,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 22:47:22,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:22,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 22:47:22,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 22:47:22,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abc8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22, skipping insertion in model container [2021-11-20 22:47:22,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 22:47:22,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 22:47:22,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-20 22:47:22,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:22,711 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 22:47:22,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-20 22:47:22,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:22,798 INFO L208 MainTranslator]: Completed translation [2021-11-20 22:47:22,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22 WrapperNode [2021-11-20 22:47:22,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:22,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:22,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 22:47:22,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 22:47:22,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,843 INFO L137 Inliner]: procedures = 19, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2021-11-20 22:47:22,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:22,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 22:47:22,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 22:47:22,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 22:47:22,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 22:47:22,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 22:47:22,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 22:47:22,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 22:47:22,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (1/1) ... [2021-11-20 22:47:22,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 22:47:22,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 22:47:22,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 22:47:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 22:47:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-20 22:47:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 22:47:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 22:47:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-20 22:47:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 22:47:22,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 22:47:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 22:47:23,068 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 22:47:23,069 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 22:47:25,624 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 22:47:25,631 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 22:47:25,631 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 22:47:25,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:25 BoogieIcfgContainer [2021-11-20 22:47:25,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 22:47:25,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 22:47:25,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 22:47:25,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 22:47:25,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:22" (1/3) ... [2021-11-20 22:47:25,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20986eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:25, skipping insertion in model container [2021-11-20 22:47:25,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:22" (2/3) ... [2021-11-20 22:47:25,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20986eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:25, skipping insertion in model container [2021-11-20 22:47:25,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:25" (3/3) ... [2021-11-20 22:47:25,641 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2021-11-20 22:47:25,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 22:47:25,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 22:47:25,694 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 22:47:25,701 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 22:47:25,701 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 22:47:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 22:47:25,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:25,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:25,731 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-11-20 22:47:25,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 22:47:25,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190807651] [2021-11-20 22:47:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:25,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 22:47:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 22:47:25,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 22:47:25,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 22:47:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:26,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 22:47:26,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 22:47:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:26,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 22:47:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:26,428 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 22:47:26,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190807651] [2021-11-20 22:47:26,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190807651] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:26,429 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:26,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 22:47:26,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20313862] [2021-11-20 22:47:26,432 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:26,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 22:47:26,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 22:47:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 22:47:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 22:47:26,478 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:28,866 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 22:47:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:28,963 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2021-11-20 22:47:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 22:47:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 22:47:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:28,973 INFO L225 Difference]: With dead ends: 35 [2021-11-20 22:47:28,973 INFO L226 Difference]: Without dead ends: 21 [2021-11-20 22:47:28,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 22:47:28,979 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:28,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-11-20 22:47:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-20 22:47:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-20 22:47:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-20 22:47:29,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2021-11-20 22:47:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:29,014 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-20 22:47:29,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-20 22:47:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 22:47:29,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:29,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:29,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 22:47:29,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 22:47:29,237 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-11-20 22:47:29,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 22:47:29,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767595034] [2021-11-20 22:47:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:29,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 22:47:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 22:47:29,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 22:47:29,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 22:47:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:29,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 22:47:29,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 22:47:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:29,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 22:47:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:47:29,967 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 22:47:29,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767595034] [2021-11-20 22:47:29,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767595034] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:29,971 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:29,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 22:47:29,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49420839] [2021-11-20 22:47:29,974 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:29,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 22:47:29,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 22:47:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 22:47:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 22:47:29,981 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:32,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 22:47:34,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 22:47:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:34,357 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-20 22:47:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 22:47:34,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-20 22:47:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:34,359 INFO L225 Difference]: With dead ends: 23 [2021-11-20 22:47:34,359 INFO L226 Difference]: Without dead ends: 19 [2021-11-20 22:47:34,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 22:47:34,361 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:34,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-11-20 22:47:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-20 22:47:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-20 22:47:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-20 22:47:34,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2021-11-20 22:47:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:34,368 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-20 22:47:34,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:47:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-20 22:47:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 22:47:34,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:34,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:34,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 22:47:34,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 22:47:34,571 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:47:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-11-20 22:47:34,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 22:47:34,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924219973] [2021-11-20 22:47:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:34,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 22:47:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 22:47:34,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 22:47:34,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 22:47:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:35,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 22:47:35,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 22:47:41,088 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-20 22:47:41,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2021-11-20 22:48:42,413 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 22:50:05,226 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from false [2021-11-20 22:50:07,252 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from true [2021-11-20 22:54:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:54:07,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 22:54:14,227 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from false [2021-11-20 22:54:16,313 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from true [2021-11-20 22:54:26,865 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2021-11-20 22:54:28,952 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from true [2021-11-20 22:54:39,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-20 22:54:41,610 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-20 22:54:52,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 22:54:54,264 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 22:55:09,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 22:55:11,226 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 22:55:30,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse5 (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) is different from false [2021-11-20 22:55:32,551 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse5 (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) is different from true [2021-11-20 22:57:04,868 WARN L227 SmtUtils]: Spent 1.54m on a formula simplification. DAG size of input: 33 DAG size of output: 11 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 22:57:04,869 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-20 22:57:04,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 300 treesize of output 162 [2021-11-20 22:58:36,716 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-20 22:58:38,798 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-20 22:58:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:58:38,800 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 22:58:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924219973] [2021-11-20 22:58:38,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924219973] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 22:58:38,800 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:58:38,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-20 22:58:38,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409316886] [2021-11-20 22:58:38,800 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 22:58:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 22:58:38,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 22:58:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 22:58:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-20 22:58:38,803 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:58:40,916 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 22:58:43,002 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 22:58:45,037 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse6 (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) (= (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse10 (select .cse11 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse12) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-20 22:58:47,124 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse6 (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) (= (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse10 (select .cse11 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse12) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 22:58:50,060 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (let ((.cse8 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= |c_ULTIMATE.start_main_#t~mem6#1| .cse2) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 22:58:52,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 22:58:54,191 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 22:58:58,072 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse17 (select .cse14 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse5 (let ((.cse16 (select .cse12 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (let ((.cse8 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse6 (let ((.cse13 (select .cse14 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse6)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse7 (select .cse3 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse10 (let ((.cse11 (select .cse12 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse10)) (fp.sub c_currentRoundingMode .cse6 .cse10))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse5)))) is different from true [2021-11-20 22:59:01,810 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse9 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse17 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse12 (let ((.cse16 (select .cse7 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse5 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse8 (select .cse3 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse10 (select .cse1 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_#t~mem7#1| .cse12) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse5)))) is different from true [2021-11-20 22:59:03,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse10 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse0 (let ((.cse16 (select .cse6 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse4 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse2 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse12)) (fp.sub c_currentRoundingMode .cse0 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse7)))) is different from false [2021-11-20 22:59:05,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse10 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse0 (let ((.cse16 (select .cse6 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse4 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse2 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse12)) (fp.sub c_currentRoundingMode .cse0 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse7)))) is different from true [2021-11-20 22:59:08,037 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 22:59:10,071 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 22:59:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:59:10,402 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-11-20 22:59:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 22:59:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-20 22:59:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:59:10,409 INFO L225 Difference]: With dead ends: 29 [2021-11-20 22:59:10,409 INFO L226 Difference]: Without dead ends: 24 [2021-11-20 22:59:10,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=62, Invalid=66, Unknown=30, NotChecked=544, Total=702 [2021-11-20 22:59:10,412 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 22:59:10,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2021-11-20 22:59:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-20 22:59:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-20 22:59:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:59:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-11-20 22:59:10,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2021-11-20 22:59:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:59:10,420 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-11-20 22:59:10,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:59:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-11-20 22:59:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 22:59:10,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:59:10,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:59:10,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 22:59:10,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 22:59:10,635 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:59:10,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:59:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-11-20 22:59:10,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 22:59:10,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300045492] [2021-11-20 22:59:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:59:10,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 22:59:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 22:59:10,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 22:59:10,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 22:59:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:59:10,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 22:59:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 22:59:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:59:11,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 22:59:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 22:59:11,145 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 22:59:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300045492] [2021-11-20 22:59:11,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300045492] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 22:59:11,146 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:59:11,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-20 22:59:11,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561286326] [2021-11-20 22:59:11,146 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 22:59:11,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 22:59:11,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 22:59:11,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 22:59:11,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 22:59:11,148 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:59:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:59:11,203 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-20 22:59:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 22:59:11,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-20 22:59:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:59:11,204 INFO L225 Difference]: With dead ends: 35 [2021-11-20 22:59:11,204 INFO L226 Difference]: Without dead ends: 20 [2021-11-20 22:59:11,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 22:59:11,206 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 22:59:11,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 22:59:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-20 22:59:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-20 22:59:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:59:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-20 22:59:11,220 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-20 22:59:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:59:11,220 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-20 22:59:11,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 22:59:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-20 22:59:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 22:59:11,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:59:11,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:59:11,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 22:59:11,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 22:59:11,424 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 22:59:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:59:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-11-20 22:59:11,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 22:59:11,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249325986] [2021-11-20 22:59:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:59:11,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 22:59:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 22:59:11,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 22:59:11,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2b7b1ce-f195-4c43-95e0-8cb31aa3ec84/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 22:59:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:59:12,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 22:59:12,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 22:59:20,926 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 22:59:20,927 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-20 22:59:20,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2021-11-20 23:00:16,953 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.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_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse0 .cse2)))) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) is different from false [2021-11-20 23:01:35,786 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.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_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse0 .cse2)))) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) is different from false