./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fd0e678ea36c7b474907750a18ff4e57877f684 ............................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fd0e678ea36c7b474907750a18ff4e57877f684 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:25:25,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:25:25,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:25:25,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:25:25,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:25:25,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:25:25,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:25:25,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:25:25,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:25:25,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:25:25,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:25:25,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:25:25,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:25:25,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:25:25,556 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:25:25,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:25:25,557 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:25:25,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:25:25,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:25:25,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:25:25,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:25:25,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:25:25,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:25:25,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:25:25,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:25:25,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:25:25,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:25:25,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:25:25,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:25:25,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:25:25,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:25:25,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:25:25,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:25:25,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:25:25,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:25:25,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:25:25,566 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 15:25:25,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:25:25,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:25:25,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:25:25,574 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:25:25,574 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:25:25,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:25:25,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:25:25,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:25:25,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:25:25,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 15:25:25,577 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-12-09 15:25:25,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:25:25,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:25:25,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:25:25,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:25:25,604 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:25:25,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-09 15:25:25,645 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/63d6d6817/846a91fb6b53442ab3b7f1f8a79fb4e0/FLAGbaddc3989 [2018-12-09 15:25:26,034 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:25:26,034 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-09 15:25:26,038 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/63d6d6817/846a91fb6b53442ab3b7f1f8a79fb4e0/FLAGbaddc3989 [2018-12-09 15:25:26,046 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/63d6d6817/846a91fb6b53442ab3b7f1f8a79fb4e0 [2018-12-09 15:25:26,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:25:26,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:25:26,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:26,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:25:26,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:25:26,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26, skipping insertion in model container [2018-12-09 15:25:26,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:25:26,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:25:26,157 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:26,159 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:25:26,169 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:26,177 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:25:26,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26 WrapperNode [2018-12-09 15:25:26,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:26,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:26,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:25:26,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:25:26,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:26,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:25:26,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:25:26,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:25:26,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... [2018-12-09 15:25:26,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:25:26,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:25:26,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:25:26,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:25:26,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:25:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:25:26,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:25:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:25:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:25:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:25:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:25:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 15:25:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 15:25:26,356 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:25:26,356 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:25:26,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:26 BoogieIcfgContainer [2018-12-09 15:25:26,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:25:26,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:25:26,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:25:26,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:25:26,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:25:26" (1/3) ... [2018-12-09 15:25:26,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec64fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:25:26, skipping insertion in model container [2018-12-09 15:25:26,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:26" (2/3) ... [2018-12-09 15:25:26,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec64fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:25:26, skipping insertion in model container [2018-12-09 15:25:26,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:26" (3/3) ... [2018-12-09 15:25:26,360 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-12-09 15:25:26,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:25:26,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 15:25:26,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 15:25:26,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:25:26,399 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:25:26,399 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:25:26,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:25:26,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:25:26,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:25:26,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:25:26,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:25:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-09 15:25:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:25:26,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:26,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:26,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:26,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-12-09 15:25:26,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:25:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:25:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:26,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:26,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:26,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:25:26,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 15:25:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 15:25:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:25:26,499 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-12-09 15:25:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:26,511 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-09 15:25:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 15:25:26,511 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-09 15:25:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:26,516 INFO L225 Difference]: With dead ends: 34 [2018-12-09 15:25:26,516 INFO L226 Difference]: Without dead ends: 15 [2018-12-09 15:25:26,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:25:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-09 15:25:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 15:25:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 15:25:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-09 15:25:26,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-12-09 15:25:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:26,538 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-09 15:25:26,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 15:25:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-09 15:25:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:26,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:26,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:26,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:26,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-12-09 15:25:26,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:25:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:26,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:25:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:26,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:26,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:26,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:25:26,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:25:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:26,602 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-12-09 15:25:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:26,613 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-09 15:25:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:26,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 15:25:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:26,614 INFO L225 Difference]: With dead ends: 27 [2018-12-09 15:25:26,614 INFO L226 Difference]: Without dead ends: 18 [2018-12-09 15:25:26,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-09 15:25:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 15:25:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 15:25:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-09 15:25:26,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-09 15:25:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:26,617 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-09 15:25:26,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:25:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-09 15:25:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:26,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:26,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:26,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:26,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-12-09 15:25:26,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:25:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:26,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:26,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:25:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:26,641 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:25:26,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:25:26 BoogieIcfgContainer [2018-12-09 15:25:26,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:25:26,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:25:26,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:25:26,657 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:25:26,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:26" (3/4) ... [2018-12-09 15:25:26,660 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:25:26,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:25:26,660 INFO L168 Benchmark]: Toolchain (without parser) took 612.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:26,661 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:25:26,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 941.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:26,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.07 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:25:26,662 INFO L168 Benchmark]: Boogie Preprocessor took 43.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:26,663 INFO L168 Benchmark]: RCFGBuilder took 122.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:26,663 INFO L168 Benchmark]: TraceAbstraction took 300.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:26,663 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:25:26,665 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 941.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.07 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 122.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 300.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 41, overapproximation of to_real at line 12, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L27] evenExp = evenExp + multFactor*term [L29] count++ [L31] term = term * (x/count) [L33] oddExp = oddExp + multFactor*term [L35] count++ [L37] temp = __VERIFIER_nondet_int() [L38] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L41] CALL __VERIFIER_assert( evenExp >= oddExp ) VAL [\old(cond)=0, pi=314159/100000] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 1 SDslu, 12 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:25:28,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:25:28,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:25:28,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:25:28,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:25:28,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:25:28,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:25:28,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:25:28,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:25:28,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:25:28,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:25:28,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:25:28,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:25:28,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:25:28,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:25:28,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:25:28,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:25:28,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:25:28,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:25:28,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:25:28,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:25:28,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:25:28,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:25:28,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:25:28,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:25:28,060 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:25:28,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:25:28,061 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:25:28,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:25:28,062 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:25:28,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:25:28,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:25:28,063 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:25:28,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:25:28,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:25:28,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:25:28,064 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 15:25:28,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:25:28,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:25:28,071 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:25:28,072 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:25:28,072 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:25:28,072 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:25:28,073 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:25:28,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:25:28,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:25:28,074 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 15:25:28,075 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:25:28,075 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 15:25:28,075 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 15:25:28,075 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-12-09 15:25:28,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:25:28,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:25:28,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:25:28,107 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:25:28,107 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:25:28,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-09 15:25:28,146 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/b32b47755/03e9dbb29d5f4184a27d6c92380148bc/FLAG973c5393a [2018-12-09 15:25:28,599 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:25:28,600 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-09 15:25:28,603 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/b32b47755/03e9dbb29d5f4184a27d6c92380148bc/FLAG973c5393a [2018-12-09 15:25:28,611 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/data/b32b47755/03e9dbb29d5f4184a27d6c92380148bc [2018-12-09 15:25:28,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:25:28,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:25:28,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:28,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:25:28,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:25:28,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265c0857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28, skipping insertion in model container [2018-12-09 15:25:28,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:25:28,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:25:28,722 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:28,725 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:25:28,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:28,745 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:25:28,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28 WrapperNode [2018-12-09 15:25:28,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:28,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:28,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:25:28,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:25:28,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:28,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:25:28,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:25:28,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:25:28,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... [2018-12-09 15:25:28,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:25:28,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:25:28,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:25:28,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:25:28,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:25:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:25:28,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:25:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:25:28,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:25:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:25:28,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:25:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 15:25:28,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 15:25:31,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:25:31,805 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:25:31,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:31 BoogieIcfgContainer [2018-12-09 15:25:31,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:25:31,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:25:31,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:25:31,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:25:31,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:25:28" (1/3) ... [2018-12-09 15:25:31,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb5106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:25:31, skipping insertion in model container [2018-12-09 15:25:31,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:28" (2/3) ... [2018-12-09 15:25:31,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb5106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:25:31, skipping insertion in model container [2018-12-09 15:25:31,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:31" (3/3) ... [2018-12-09 15:25:31,810 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-12-09 15:25:31,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:25:31,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 15:25:31,830 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 15:25:31,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:25:31,846 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:25:31,846 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:25:31,847 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:25:31,847 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:25:31,847 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:25:31,847 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:25:31,847 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:25:31,847 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:25:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-09 15:25:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:25:31,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:31,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:31,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:31,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-12-09 15:25:31,866 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:25:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-09 15:25:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:31,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:31,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:25:31,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:31,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:31,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 15:25:31,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 15:25:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:25:31,947 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-12-09 15:25:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:31,958 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-09 15:25:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 15:25:31,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-09 15:25:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:31,963 INFO L225 Difference]: With dead ends: 34 [2018-12-09 15:25:31,964 INFO L226 Difference]: Without dead ends: 15 [2018-12-09 15:25:31,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:25:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-09 15:25:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 15:25:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 15:25:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-09 15:25:31,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-12-09 15:25:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:31,985 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-09 15:25:31,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 15:25:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-09 15:25:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:31,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:31,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:31,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:31,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-12-09 15:25:31,987 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:25:31,987 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-09 15:25:31,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:32,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:32,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:25:32,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:32,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:32,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:25:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:32,657 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-12-09 15:25:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:35,718 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-09 15:25:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:35,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 15:25:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:35,720 INFO L225 Difference]: With dead ends: 27 [2018-12-09 15:25:35,720 INFO L226 Difference]: Without dead ends: 18 [2018-12-09 15:25:35,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-09 15:25:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 15:25:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 15:25:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-09 15:25:35,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-09 15:25:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:35,724 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-09 15:25:35,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:25:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-09 15:25:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:35,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:35,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:35,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:25:35,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-12-09 15:25:35,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:25:35,726 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-09 15:25:35,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:37,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:53,624 WARN L180 SmtUtils]: Spent 12.36 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 15:26:09,743 WARN L180 SmtUtils]: Spent 13.10 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 15:26:12,027 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2018-12-09 15:26:14,272 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2018-12-09 15:26:25,909 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven v_prenex_2 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2018-12-09 15:26:37,583 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven v_prenex_2 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-12-09 15:26:44,427 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) is different from false [2018-12-09 15:26:46,684 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) is different from true [2018-12-09 15:26:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:46,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:26:46,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:26:46,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:26:46,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=22, Unknown=6, NotChecked=44, Total=90 [2018-12-09 15:26:46,704 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-12-09 15:26:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:57,198 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-09 15:26:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:26:57,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-09 15:26:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:57,199 INFO L225 Difference]: With dead ends: 24 [2018-12-09 15:26:57,199 INFO L226 Difference]: Without dead ends: 19 [2018-12-09 15:26:57,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=22, Invalid=30, Unknown=6, NotChecked=52, Total=110 [2018-12-09 15:26:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-09 15:26:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-09 15:26:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 15:26:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-09 15:26:57,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-12-09 15:26:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:57,203 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-09 15:26:57,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:26:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-09 15:26:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 15:26:57,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:57,204 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:57,204 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:26:57,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1791799675, now seen corresponding path program 1 times [2018-12-09 15:26:57,205 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:26:57,205 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-09 15:26:57,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:58,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:58,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:26:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:58,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:26:58,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:26:58,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:59,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:59,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:26:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:59,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 15:26:59,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-12-09 15:26:59,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:26:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:26:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:26:59,483 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-12-09 15:27:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:08,123 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-09 15:27:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:27:08,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 15:27:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:08,126 INFO L225 Difference]: With dead ends: 36 [2018-12-09 15:27:08,126 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 15:27:08,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:27:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 15:27:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-09 15:27:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 15:27:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-09 15:27:08,130 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-12-09 15:27:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:08,131 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-09 15:27:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:27:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-09 15:27:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 15:27:08,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:08,131 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:08,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:08,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash -728160259, now seen corresponding path program 1 times [2018-12-09 15:27:08,132 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:27:08,132 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-09 15:27:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:28,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:27:46,150 WARN L180 SmtUtils]: Spent 12.91 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 15:28:04,197 WARN L180 SmtUtils]: Spent 13.44 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 15:28:06,525 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-12-09 15:28:08,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from true [2018-12-09 15:28:10,980 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2018-12-09 15:28:14,667 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2018-12-09 15:28:17,619 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from false [2018-12-09 15:28:19,930 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from true [2018-12-09 15:28:31,989 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))) is different from false [2018-12-09 15:28:44,028 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-12-09 15:28:51,039 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-12-09 15:28:53,357 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-12-09 15:28:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-09 15:28:53,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:29:00,866 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:29:02,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:29:05,036 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:29:07,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:29:09,233 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:29:11,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:29:13,562 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-12-09 15:29:15,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-12-09 15:29:17,969 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-12-09 15:29:20,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-12-09 15:29:22,415 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-12-09 15:29:24,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-12-09 15:29:27,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.lt v_main_~term~0_26 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 15:29:34,593 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_26 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-09 15:29:36,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_26 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-09 15:29:36,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:36,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:36,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-09 15:29:49,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:29:49,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-12-09 15:29:49,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 15:29:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 15:29:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=57, Unknown=26, NotChecked=420, Total=552 [2018-12-09 15:29:49,925 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-12-09 15:29:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:57,730 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-09 15:29:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 15:29:57,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-12-09 15:29:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:57,732 INFO L225 Difference]: With dead ends: 32 [2018-12-09 15:29:57,732 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 15:29:57,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.9s TimeCoverageRelationStatistics Valid=54, Invalid=70, Unknown=26, NotChecked=450, Total=600 [2018-12-09 15:29:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 15:29:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 15:29:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 15:29:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-09 15:29:57,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-12-09 15:29:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:57,737 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 15:29:57,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 15:29:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-09 15:29:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:29:57,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:57,738 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:57,738 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:29:57,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1901913127, now seen corresponding path program 2 times [2018-12-09 15:29:57,739 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:29:57,739 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-09 15:29:57,743 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 15:31:10,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:31:10,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:10,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:31,489 WARN L180 SmtUtils]: Spent 16.77 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 15:31:50,811 WARN L180 SmtUtils]: Spent 14.91 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 15:31:53,095 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-12-09 15:31:56,909 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-12-09 15:31:59,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-12-09 15:32:01,516 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-12-09 15:32:03,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-12-09 15:32:06,170 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= (_ bv6 32) c_main_~count~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-12-09 15:32:08,578 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (_ bv6 32) c_main_~count~0) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))) is different from false [2018-12-09 15:32:10,984 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (_ bv6 32) c_main_~count~0) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32))))))) is different from false [2018-12-09 15:32:13,507 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))) is different from false [2018-12-09 15:32:15,980 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))) is different from true [2018-12-09 15:32:29,092 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-12-09 15:32:42,224 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-12-09 15:32:49,773 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-12-09 15:32:52,252 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-12-09 15:32:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-12-09 15:32:52,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:32:57,872 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:32:59,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:33:02,041 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:33:04,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:33:06,260 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-12-09 15:33:08,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-12-09 15:33:10,619 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-12-09 15:33:12,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-12-09 15:33:15,040 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-12-09 15:33:17,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-12-09 15:33:19,499 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-12-09 15:33:21,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-12-09 15:33:24,091 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-12-09 15:33:26,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-12-09 15:33:28,750 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-12-09 15:33:31,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-12-09 15:33:33,455 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from false [2018-12-09 15:33:35,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from true [2018-12-09 15:33:39,332 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-12-09 15:33:46,835 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from false [2018-12-09 15:33:49,352 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-12-09 15:33:49,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:33:49,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:33:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:34:13,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:34:13,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-09 15:34:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:34:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-12-09 15:34:14,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 15:34:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 15:34:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=60, Unknown=35, NotChecked=714, Total=870 [2018-12-09 15:34:14,289 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-12-09 15:34:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:34:26,327 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-09 15:34:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 15:34:26,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-12-09 15:34:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:34:26,328 INFO L225 Difference]: With dead ends: 36 [2018-12-09 15:34:26,329 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 15:34:26,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 129.6s TimeCoverageRelationStatistics Valid=66, Invalid=73, Unknown=35, NotChecked=756, Total=930 [2018-12-09 15:34:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 15:34:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 15:34:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 15:34:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-09 15:34:26,336 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-12-09 15:34:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:34:26,337 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-09 15:34:26,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 15:34:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-09 15:34:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 15:34:26,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:34:26,338 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:34:26,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:34:26,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:34:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -429521713, now seen corresponding path program 2 times [2018-12-09 15:34:26,338 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:34:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-09 15:34:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:34:28,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:34:28,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:34:28,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:34:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:34:28,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:34:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:34:28,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:34:28,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:34:29,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:34:42,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:34:42,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:34:42,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:34:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:34:42,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:34:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:34:42,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 15:34:42,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-09 15:34:42,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:34:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:34:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:34:42,914 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-12-09 15:35:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:35:02,933 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-12-09 15:35:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:35:02,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-09 15:35:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:35:02,934 INFO L225 Difference]: With dead ends: 61 [2018-12-09 15:35:02,934 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 15:35:02,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:35:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 15:35:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-12-09 15:35:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:35:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 15:35:02,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 26 [2018-12-09 15:35:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:35:02,939 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 15:35:02,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:35:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 15:35:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 15:35:02,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:35:02,940 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:35:02,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:35:02,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:35:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1345485649, now seen corresponding path program 3 times [2018-12-09 15:35:02,940 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 15:35:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de459bb9-ef4f-4d8b-9498-51942afde524/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-09 15:35:02,950 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 15:37:43,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 15:37:43,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:37:43,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:37:45,390 WARN L832 $PredicateComparison]: unable to prove that (and (= c_main_~x~0 c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967294 32)) (_ bv0 32)) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) is different from false [2018-12-09 15:38:01,912 WARN L180 SmtUtils]: Spent 13.65 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 15:38:04,213 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-12-09 15:38:06,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from true [2018-12-09 15:38:08,802 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-12-09 15:38:11,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-12-09 15:38:13,395 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-12-09 15:38:15,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-12-09 15:38:18,025 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2018-12-09 15:38:20,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2018-12-09 15:38:22,865 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-12-09 15:38:25,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-12-09 15:38:27,565 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (not (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-12-09 15:38:29,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (not (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-12-09 15:38:32,536 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse1))))))))) is different from false [2018-12-09 15:38:35,118 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse1))))))))) is different from true [2018-12-09 15:38:37,675 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from false [2018-12-09 15:38:40,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from true [2018-12-09 15:38:42,653 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from false [2018-12-09 15:38:45,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from true [2018-12-09 15:38:47,986 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))))) is different from false [2018-12-09 15:38:50,533 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))))) is different from true [2018-12-09 15:39:02,589 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 15:39:02,790 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2018-12-09 15:39:02,792 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-09 15:39:02,798 INFO L168 Benchmark]: Toolchain (without parser) took 814184.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:39:02,800 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:39:02,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.98 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:39:02,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.61 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:39:02,802 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:39:02,803 INFO L168 Benchmark]: RCFGBuilder took 3029.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:39:02,805 INFO L168 Benchmark]: TraceAbstraction took 810990.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:39:02,807 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.98 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.61 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3029.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 810990.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...