./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:29:30,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:29:30,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:29:30,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:29:30,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:29:30,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:29:30,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:29:30,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:29:30,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:29:30,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:29:30,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:29:30,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:29:30,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:29:30,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:29:30,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:29:30,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:29:30,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:29:30,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:29:30,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:29:30,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:29:30,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:29:30,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:29:30,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:29:30,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:29:30,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:29:30,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:29:30,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:29:30,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:29:30,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:29:30,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:29:30,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:29:30,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:29:30,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:29:30,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:29:30,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:29:30,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:29:30,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:29:30,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:29:30,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:29:30,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:29:30,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:29:30,140 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-13 02:29:30,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:29:30,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:29:30,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:29:30,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:29:30,178 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:29:30,178 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:29:30,178 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:29:30,179 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-13 02:29:30,179 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:29:30,179 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:29:30,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-13 02:29:30,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-13 02:29:30,180 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:29:30,181 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-13 02:29:30,181 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-13 02:29:30,182 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-13 02:29:30,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:29:30,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:29:30,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 02:29:30,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:29:30,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:29:30,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:29:30,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:29:30,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:29:30,189 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:29:30,190 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:29:30,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:29:30,190 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:29:30,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:29:30,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:29:30,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:29:30,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:29:30,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:29:30,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:29:30,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:29:30,195 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-13 02:29:30,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 02:29:30,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:29:30,197 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:29:30,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:29:30,198 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_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/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_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-13 02:29:30,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:29:30,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:29:30,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:29:30,531 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:29:30,532 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:29:30,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:30,627 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ae6585f71/9634c0748c4c4b149e8c9874c26c81ce/FLAG1a48c2173 [2021-11-13 02:29:31,225 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:29:31,226 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:31,241 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ae6585f71/9634c0748c4c4b149e8c9874c26c81ce/FLAG1a48c2173 [2021-11-13 02:29:31,582 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ae6585f71/9634c0748c4c4b149e8c9874c26c81ce [2021-11-13 02:29:31,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:29:31,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:29:31,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:29:31,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:29:31,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:29:31,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:31,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bc1424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31, skipping insertion in model container [2021-11-13 02:29:31,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:31,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:29:31,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:29:31,833 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-13 02:29:31,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:29:31,866 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:29:31,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-13 02:29:31,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:29:31,942 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:29:31,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31 WrapperNode [2021-11-13 02:29:31,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:29:31,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:29:31,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:29:31,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:29:31,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:31,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:29:32,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:29:32,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:29:32,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:29:32,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:29:32,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:29:32,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:29:32,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:29:32,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (1/1) ... [2021-11-13 02:29:32,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:29:32,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:29:32,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:29:32,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:29:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 02:29:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:29:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-13 02:29:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:29:32,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:29:32,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-13 02:29:32,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 02:29:32,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:29:32,461 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 02:29:32,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:32 BoogieIcfgContainer [2021-11-13 02:29:32,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:29:32,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:29:32,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:29:32,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:29:32,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:29:31" (1/3) ... [2021-11-13 02:29:32,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:32, skipping insertion in model container [2021-11-13 02:29:32,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:31" (2/3) ... [2021-11-13 02:29:32,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:32, skipping insertion in model container [2021-11-13 02:29:32,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:32" (3/3) ... [2021-11-13 02:29:32,472 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:32,477 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:29:32,477 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:29:32,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:29:32,534 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-13 02:29:32,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:29:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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-13 02:29:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-13 02:29:32,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:29:32,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:29:32,557 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:29:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:29:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2021-11-13 02:29:32,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 02:29:32,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721579318] [2021-11-13 02:29:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:29:32,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 02:29:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:29:32,817 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-13 02:29:32,818 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 02:29:32,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721579318] [2021-11-13 02:29:32,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721579318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 02:29:32,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:29:32,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 02:29:32,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599802652] [2021-11-13 02:29:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 02:29:32,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 02:29:32,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 02:29:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 02:29:32,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 02:29:32,883 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 02:29:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:29:32,987 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2021-11-13 02:29:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 02:29:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 02:29:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:29:33,000 INFO L225 Difference]: With dead ends: 35 [2021-11-13 02:29:33,001 INFO L226 Difference]: Without dead ends: 21 [2021-11-13 02:29:33,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-13 02:29:33,009 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.29ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.47ms IncrementalHoareTripleChecker+Time [2021-11-13 02:29:33,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 3.29ms Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 47.47ms Time] [2021-11-13 02:29:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-13 02:29:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-13 02:29:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-13 02:29:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-11-13 02:29:33,049 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2021-11-13 02:29:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:29:33,050 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-11-13 02:29:33,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-13 02:29:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-11-13 02:29:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-13 02:29:33,051 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:29:33,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:29:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 02:29:33,052 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:29:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:29:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2021-11-13 02:29:33,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 02:29:33,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234711453] [2021-11-13 02:29:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:29:33,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 02:29:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:29:33,112 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 02:29:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:29:33,210 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-13 02:29:33,210 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 02:29:33,212 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 02:29:33,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 02:29:33,218 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-13 02:29:33,222 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 02:29:33,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:29:33 BoogieIcfgContainer [2021-11-13 02:29:33,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 02:29:33,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 02:29:33,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 02:29:33,266 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 02:29:33,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:32" (3/4) ... [2021-11-13 02:29:33,270 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 02:29:33,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 02:29:33,272 INFO L158 Benchmark]: Toolchain (without parser) took 1685.70ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 59.7MB in the beginning and 92.4MB in the end (delta: -32.8MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2021-11-13 02:29:33,272 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:29:33,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.87ms. Allocated memory is still 92.3MB. Free memory was 59.5MB in the beginning and 68.1MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-13 02:29:33,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.25ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:29:33,274 INFO L158 Benchmark]: Boogie Preprocessor took 57.47ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 64.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:29:33,275 INFO L158 Benchmark]: RCFGBuilder took 396.08ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 50.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-13 02:29:33,276 INFO L158 Benchmark]: TraceAbstraction took 799.81ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 93.0MB in the end (delta: -43.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:29:33,276 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 92.4MB in the end (delta: 587.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:29:33,282 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.34ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.87ms. Allocated memory is still 92.3MB. Free memory was 59.5MB in the beginning and 68.1MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.25ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.47ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 64.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.08ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 50.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 799.81ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 93.0MB in the end (delta: -43.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 92.4MB in the end (delta: 587.1kB). 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 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0, main__max={6:0}, main__min={7:0}, main__min[0]=51, main__org={3:0}, main__slope={4:0}] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0, main__max={6:0}, main__max[4UL]=50, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__max[main__i]=49, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L34] 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_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={3: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_136=0, __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={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_136=0, __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={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] [L53] reach_error() VAL [__return_136=0, __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={6:0}, main__min={7:0}, main__org={3:0}, main__slope={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, 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, 37 SdHoareTripleChecker+Valid, 47.47ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 39.77ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 23 mSolverCounterSat, 3.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-13 02:29:33,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/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_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:29:35,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:29:35,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:29:36,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:29:36,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:29:36,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:29:36,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:29:36,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:29:36,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:29:36,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:29:36,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:29:36,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:29:36,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:29:36,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:29:36,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:29:36,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:29:36,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:29:36,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:29:36,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:29:36,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:29:36,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:29:36,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:29:36,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:29:36,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:29:36,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:29:36,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:29:36,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:29:36,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:29:36,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:29:36,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:29:36,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:29:36,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:29:36,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:29:36,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:29:36,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:29:36,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:29:36,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:29:36,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:29:36,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:29:36,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:29:36,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:29:36,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-13 02:29:36,169 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:29:36,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:29:36,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:29:36,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:29:36,171 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:29:36,172 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:29:36,172 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:29:36,172 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:29:36,172 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:29:36,173 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:29:36,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:29:36,176 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:29:36,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:29:36,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:29:36,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:29:36,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:29:36,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:29:36,177 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:29:36,177 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-13 02:29:36,178 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-13 02:29:36,178 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:29:36,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:29:36,178 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:29:36,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:29:36,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:29:36,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 02:29:36,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:29:36,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:29:36,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:29:36,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:29:36,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:29:36,181 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-13 02:29:36,181 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-13 02:29:36,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:29:36,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:29:36,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:29:36,183 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_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/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_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-13 02:29:36,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:29:36,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:29:36,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:29:36,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:29:36,682 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:29:36,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:36,767 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ea08396cf/fc2efaebea654f6ab1d1b72c50704296/FLAGe2414b1d3 [2021-11-13 02:29:37,543 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:29:37,544 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:37,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ea08396cf/fc2efaebea654f6ab1d1b72c50704296/FLAGe2414b1d3 [2021-11-13 02:29:37,877 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/data/ea08396cf/fc2efaebea654f6ab1d1b72c50704296 [2021-11-13 02:29:37,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:29:37,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:29:37,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:29:37,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:29:37,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:29:37,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:37" (1/1) ... [2021-11-13 02:29:37,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:37, skipping insertion in model container [2021-11-13 02:29:37,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:37" (1/1) ... [2021-11-13 02:29:37,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:29:37,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:29:38,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-13 02:29:38,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:29:38,152 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:29:38,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-13 02:29:38,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:29:38,215 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:29:38,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38 WrapperNode [2021-11-13 02:29:38,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:29:38,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:29:38,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:29:38,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:29:38,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:29:38,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:29:38,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:29:38,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:29:38,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:29:38,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:29:38,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:29:38,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:29:38,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (1/1) ... [2021-11-13 02:29:38,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:29:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:29:38,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:29:38,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:29:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-13 02:29:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-13 02:29:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:29:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-13 02:29:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:29:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:29:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 02:29:41,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:29:41,456 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 02:29:41,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:41 BoogieIcfgContainer [2021-11-13 02:29:41,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:29:41,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:29:41,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:29:41,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:29:41,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:29:37" (1/3) ... [2021-11-13 02:29:41,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6683d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:41, skipping insertion in model container [2021-11-13 02:29:41,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:38" (2/3) ... [2021-11-13 02:29:41,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6683d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:41, skipping insertion in model container [2021-11-13 02:29:41,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:41" (3/3) ... [2021-11-13 02:29:41,470 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-13 02:29:41,476 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:29:41,476 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:29:41,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:29:41,532 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-13 02:29:41,532 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:29:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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-13 02:29:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-13 02:29:41,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:29:41,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:29:41,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:29:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:29:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-13 02:29:41,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:29:41,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462619137] [2021-11-13 02:29:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:29:41,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:29:41,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:29:41,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:29:41,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-13 02:29:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:29:42,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 02:29:42,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:29:42,537 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-13 02:29:42,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:29:42,742 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-13 02:29:42,743 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:29:42,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462619137] [2021-11-13 02:29:42,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462619137] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:29:42,744 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:29:42,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-13 02:29:42,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125894150] [2021-11-13 02:29:42,748 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:29:42,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 02:29:42,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:29:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 02:29:42,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 02:29:42,789 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 2.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-13 02:29:45,101 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 02:29:47,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 02:29:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:29:47,284 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2021-11-13 02:29:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 02:29:47,291 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-13 02:29:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:29:47,301 INFO L225 Difference]: With dead ends: 38 [2021-11-13 02:29:47,302 INFO L226 Difference]: Without dead ends: 22 [2021-11-13 02:29:47,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-13 02:29:47,309 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4335.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.12ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4427.07ms IncrementalHoareTripleChecker+Time [2021-11-13 02:29:47,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 15 Unknown, 0 Unchecked, 3.12ms Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 4427.07ms Time] [2021-11-13 02:29:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-13 02:29:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-13 02:29:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-13 02:29:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-13 02:29:47,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-11-13 02:29:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:29:47,352 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-13 02:29:47,353 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-13 02:29:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-13 02:29:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-13 02:29:47,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:29:47,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:29:47,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-13 02:29:47,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:29:47,570 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:29:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:29:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2021-11-13 02:29:47,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:29:47,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012579358] [2021-11-13 02:29:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:29:47,573 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:29:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:29:47,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:29:47,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-13 02:29:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:29:48,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-13 02:29:48,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:29:56,557 WARN L227 SmtUtils]: Spent 5.46s 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-13 02:29:56,558 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-13 02:29:56,559 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-13 02:30:50,402 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-13 02:32:12,839 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-13 02:32:14,876 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-13 02:36:20,785 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-13 02:36:20,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:36:28,413 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-13 02:36:30,510 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-13 02:36:41,159 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#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-13 02:36:43,251 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#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-13 02:36:53,884 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-13 02:36:55,982 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-13 02:37:06,606 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-13 02:37:08,698 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-13 02:37:23,670 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~mem9#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-13 02:37:25,771 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~mem9#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-13 02:37:45,173 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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (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)))))) is different from false [2021-11-13 02:37:47,261 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.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (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)))))) is different from true [2021-11-13 02:39:19,660 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-13 02:39:19,661 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-13 02:39:19,662 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-13 02:40:53,686 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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (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 (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (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-13 02:40:55,778 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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (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 (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (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-13 02:40:55,779 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-13 02:40:55,780 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:40:55,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012579358] [2021-11-13 02:40:55,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012579358] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:40:55,780 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:40:55,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-13 02:40:55,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465536358] [2021-11-13 02:40:55,781 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:40:55,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-13 02:40:55,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:40:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-13 02:40:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-13 02:40:55,785 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-13 02:40:57,919 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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (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 (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (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-13 02:41:00,008 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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (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 (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (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-13 02:41:02,045 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (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)))) (.cse3 (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)))) (= (let ((.cse1 (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) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse2 (select .cse3 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse4) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse10 (let ((.cse12 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (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))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse7 (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) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse9 (let ((.cse11 (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) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (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))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse10 .cse9))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse10)))))) (= |c_ULTIMATE.start_main_#t~mem8#1| .cse4) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse3 |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-13 02:41:04,130 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (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)))) (.cse3 (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)))) (= (let ((.cse1 (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) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse2 (select .cse3 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse4) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse10 (let ((.cse12 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (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))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse7 (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) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse9 (let ((.cse11 (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) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (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))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse10 .cse9))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse10)))))) (= |c_ULTIMATE.start_main_#t~mem8#1| .cse4) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse3 |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-13 02:41:06,172 WARN L838 $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)))) (.cse4 (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse2 (let ((.cse6 (select .cse7 (bvadd (_ bv16 32) |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))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem9#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))) (= |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_ULTIMATE.start_main_#t~mem9#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-13 02:41:08,261 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)))) (.cse4 (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse2 (let ((.cse6 (select .cse7 (bvadd (_ bv16 32) |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))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem9#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))) (= |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_ULTIMATE.start_main_#t~mem9#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-13 02:41:10,304 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-13 02:41:12,390 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-13 02:41:14,438 WARN L838 $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 false [2021-11-13 02:41:16,527 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-13 02:41:18,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse11 (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)))) (.cse6 (let ((.cse16 (select .cse14 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse12 (let ((.cse15 (select .cse8 |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)) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse5 (let ((.cse7 (select .cse8 (bvadd .cse2 |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 ((.cse3 (select .cse4 (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| .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (= (let ((.cse10 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse11 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse11) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse6 |c_ULTIMATE.start_main_#t~mem10#1|) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse14 |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) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse12)))) is different from false [2021-11-13 02:41:20,690 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse11 (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)))) (.cse6 (let ((.cse16 (select .cse14 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse12 (let ((.cse15 (select .cse8 |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)) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem10#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse5 (let ((.cse7 (select .cse8 (bvadd .cse2 |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 ((.cse3 (select .cse4 (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| .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (= (let ((.cse10 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse11 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse11) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse6 |c_ULTIMATE.start_main_#t~mem10#1|) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse14 |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) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse12)))) is different from true [2021-11-13 02:41:22,754 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-13 02:41:24,843 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-13 02:41:26,909 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-13 02:41:28,945 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-13 02:41:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:41:29,526 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2021-11-13 02:41:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 02:41:29,528 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-13 02:41:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:41:29,529 INFO L225 Difference]: With dead ends: 29 [2021-11-13 02:41:29,529 INFO L226 Difference]: Without dead ends: 24 [2021-11-13 02:41:29,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.1s TimeCoverageRelationStatistics Valid=62, Invalid=63, Unknown=33, NotChecked=544, Total=702 [2021-11-13 02:41:29,531 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 624.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 670.62ms IncrementalHoareTripleChecker+Time [2021-11-13 02:41:29,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 182 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 155 Unchecked, 670.62ms Time] [2021-11-13 02:41:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-13 02:41:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-13 02:41:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-13 02:41:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-11-13 02:41:29,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2021-11-13 02:41:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:41:29,540 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-11-13 02:41:29,540 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-13 02:41:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-11-13 02:41:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-13 02:41:29,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:41:29,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:41:29,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-13 02:41:29,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:41:29,742 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:41:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:41:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2021-11-13 02:41:29,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:41:29,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192153417] [2021-11-13 02:41:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:41:29,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:41:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:41:29,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:41:29,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_443bb713-c211-43cf-a282-b26d1f158ce0/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-13 02:41:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:41:30,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-13 02:41:30,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:41:37,764 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-13 02:41:37,764 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-13 02:42:44,977 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-13 02:44:01,618 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