./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c --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_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ..................................................................................................................................................................................................................................................................................................................... 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_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:48:48,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:48:48,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:48:48,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:48:48,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:48:48,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:48:48,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:48:48,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:48:48,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:48:48,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:48:48,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:48:48,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:48:48,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:48:48,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:48:48,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:48:48,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:48:48,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:48:48,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:48:48,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:48:48,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:48:48,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:48:48,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:48:48,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:48:48,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:48:48,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:48:48,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:48:48,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:48:48,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:48:48,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:48:48,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:48:48,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:48:48,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:48:48,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:48:48,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:48:48,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:48:48,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:48:48,802 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 19:48:48,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:48:48,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:48:48,809 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:48:48,809 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:48:48,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:48:48,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:48:48,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:48:48,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:48:48,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:48:48,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:48:48,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:48:48,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:48:48,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:48:48,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:48:48,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:48:48,812 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_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer 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 -> Automizer 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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-12-01 19:48:48,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:48:48,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:48:48,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:48:48,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:48:48,845 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:48:48,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-01 19:48:48,879 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/0793cf34b/d4bb2e1df9514864bb09d73c9996c267/FLAGe336f31c1 [2018-12-01 19:48:49,250 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:48:49,251 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-01 19:48:49,254 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/0793cf34b/d4bb2e1df9514864bb09d73c9996c267/FLAGe336f31c1 [2018-12-01 19:48:49,264 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/0793cf34b/d4bb2e1df9514864bb09d73c9996c267 [2018-12-01 19:48:49,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:48:49,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:48:49,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:48:49,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:48:49,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:48:49,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97cb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49, skipping insertion in model container [2018-12-01 19:48:49,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:48:49,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:48:49,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:48:49,383 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:48:49,396 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:48:49,408 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:48:49,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49 WrapperNode [2018-12-01 19:48:49,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:48:49,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:48:49,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:48:49,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:48:49,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:48:49,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:48:49,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:48:49,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:48:49,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... [2018-12-01 19:48:49,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:48:49,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:48:49,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:48:49,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:48:49,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/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-01 19:48:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 19:48:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 19:48:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-01 19:48:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:48:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-12-01 19:48:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 19:48:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:48:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 19:48:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 19:48:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:48:49,623 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:48:49,624 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 19:48:49,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:48:49 BoogieIcfgContainer [2018-12-01 19:48:49,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:48:49,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:48:49,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:48:49,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:48:49,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:48:49" (1/3) ... [2018-12-01 19:48:49,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acfef2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:48:49, skipping insertion in model container [2018-12-01 19:48:49,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:49" (2/3) ... [2018-12-01 19:48:49,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acfef2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:48:49, skipping insertion in model container [2018-12-01 19:48:49,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:48:49" (3/3) ... [2018-12-01 19:48:49,628 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-12-01 19:48:49,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:48:49,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 19:48:49,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 19:48:49,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:48:49,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:48:49,668 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:48:49,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:48:49,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:48:49,668 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:48:49,668 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:48:49,668 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:48:49,668 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:48:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-01 19:48:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 19:48:49,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:48:49,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:48:49,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:48:49,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:48:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-12-01 19:48:49,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:48:49,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:48:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:48:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:48:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:48:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:48:49,801 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-01 19:48:49,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:48:49,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:48:49,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:48:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:48:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:48:49,813 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-01 19:48:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:48:49,829 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-01 19:48:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:48:49,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-01 19:48:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:48:49,835 INFO L225 Difference]: With dead ends: 42 [2018-12-01 19:48:49,835 INFO L226 Difference]: Without dead ends: 19 [2018-12-01 19:48:49,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01 19:48:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-01 19:48:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-01 19:48:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 19:48:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-01 19:48:49,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-01 19:48:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:48:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-01 19:48:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:48:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-01 19:48:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:48:49,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:48:49,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:48:49,858 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:48:49,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:48:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-12-01 19:48:49,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:48:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:48:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:48:49,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:48:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:48:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:48:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:48:49,910 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 19:48:49,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:48:49 BoogieIcfgContainer [2018-12-01 19:48:49,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:48:49,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:48:49,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:48:49,927 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:48:49,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:48:49" (3/4) ... [2018-12-01 19:48:49,929 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 19:48:49,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:48:49,929 INFO L168 Benchmark]: Toolchain (without parser) took 662.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 953.3 MB in the beginning and 1.0 GB in the end (delta: -94.9 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,930 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:48:49,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,931 INFO L168 Benchmark]: Boogie Preprocessor took 21.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,932 INFO L168 Benchmark]: RCFGBuilder took 147.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,932 INFO L168 Benchmark]: TraceAbstraction took 301.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-01 19:48:49,932 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:48:49,934 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 46.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 147.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 301.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of to_real at line 26. Possible FailurePath: [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L46] CALL, EXPR inv(a) VAL [\old(A)=20] [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 VAL [\old(A)=20, A=20, A_u={12:0}, cond=1, exp=-1024, xi=15, xi_u={21:0}] [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L30] COND FALSE !(\read(cond)) VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L36] return xi; [L36] return xi; [L36] return xi; VAL [\old(A)=20, \result=10, A=20, cond=0, exp=-1024, xi=10, xsi=10] [L46] RET, EXPR inv(a) VAL [a=20, inv(a)=10] [L46] r = inv(a) [L48] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) VAL [\old(cond)=0] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 22 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-01 19:48:51,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:48:51,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:48:51,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:48:51,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:48:51,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:48:51,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:48:51,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:48:51,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:48:51,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:48:51,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:48:51,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:48:51,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:48:51,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:48:51,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:48:51,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:48:51,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:48:51,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:48:51,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:48:51,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:48:51,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:48:51,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:48:51,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:48:51,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:48:51,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:48:51,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:48:51,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:48:51,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:48:51,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:48:51,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:48:51,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:48:51,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:48:51,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:48:51,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:48:51,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:48:51,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:48:51,271 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-01 19:48:51,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:48:51,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:48:51,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:48:51,281 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:48:51,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:48:51,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:48:51,282 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:48:51,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:48:51,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:48:51,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:48:51,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:48:51,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:48:51,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:48:51,284 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 19:48:51,285 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-01 19:48:51,285 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_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer 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 -> Automizer 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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-12-01 19:48:51,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:48:51,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:48:51,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:48:51,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:48:51,322 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:48:51,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-01 19:48:51,365 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/44d4d8195/f9dad52b28c9485ca7fbcb739b26c382/FLAGf5840c356 [2018-12-01 19:48:51,658 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:48:51,658 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-01 19:48:51,662 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/44d4d8195/f9dad52b28c9485ca7fbcb739b26c382/FLAGf5840c356 [2018-12-01 19:48:52,098 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/data/44d4d8195/f9dad52b28c9485ca7fbcb739b26c382 [2018-12-01 19:48:52,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:48:52,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:48:52,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:48:52,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:48:52,104 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:48:52,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a0bb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52, skipping insertion in model container [2018-12-01 19:48:52,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:48:52,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:48:52,213 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:48:52,216 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:48:52,231 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:48:52,246 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:48:52,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52 WrapperNode [2018-12-01 19:48:52,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:48:52,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:48:52,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:48:52,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:48:52,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:48:52,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:48:52,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:48:52,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:48:52,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... [2018-12-01 19:48:52,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:48:52,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:48:52,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:48:52,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:48:52,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/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-01 19:48:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-01 19:48:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-01 19:48:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 19:48:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 19:48:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-12-01 19:48:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-12-01 19:48:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 19:48:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:48:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 19:48:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 19:48:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:48:52,459 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:48:54,557 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:48:54,557 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 19:48:54,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:48:54 BoogieIcfgContainer [2018-12-01 19:48:54,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:48:54,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:48:54,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:48:54,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:48:54,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:48:52" (1/3) ... [2018-12-01 19:48:54,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602b8076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:48:54, skipping insertion in model container [2018-12-01 19:48:54,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:48:52" (2/3) ... [2018-12-01 19:48:54,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602b8076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:48:54, skipping insertion in model container [2018-12-01 19:48:54,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:48:54" (3/3) ... [2018-12-01 19:48:54,563 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-12-01 19:48:54,569 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:48:54,573 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 19:48:54,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 19:48:54,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:48:54,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:48:54,602 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:48:54,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:48:54,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:48:54,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:48:54,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:48:54,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:48:54,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:48:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-01 19:48:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 19:48:54,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:48:54,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:48:54,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:48:54,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:48:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-12-01 19:48:54,624 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 19:48:54,624 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/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-01 19:48:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:48:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:48:54,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:48:54,717 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-01 19:48:54,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:48:54,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:48:54,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:48:54,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:48:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:48:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:48:54,737 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-01 19:48:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:48:56,961 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-01 19:48:56,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:48:56,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-01 19:48:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:48:56,971 INFO L225 Difference]: With dead ends: 42 [2018-12-01 19:48:56,971 INFO L226 Difference]: Without dead ends: 19 [2018-12-01 19:48:56,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-01 19:48:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-01 19:48:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-01 19:48:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 19:48:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-01 19:48:56,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-01 19:48:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:48:56,998 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-01 19:48:56,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:48:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-01 19:48:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:48:56,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:48:56,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:48:56,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:48:56,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:48:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-12-01 19:48:57,000 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 19:48:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/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-01 19:48:57,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:48:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:48:57,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:48:57,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 216 [2018-12-01 19:48:57,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2018-12-01 19:48:57,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:48:57,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:48:57,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 162 [2018-12-01 19:48:57,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 157 [2018-12-01 19:48:57,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-12-01 19:48:57,999 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 19:48:58,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:48:58,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:48:58,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 19:48:58,043 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:252, output treesize:99 [2018-12-01 19:49:06,832 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-01 19:49:21,230 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-01 19:49:23,318 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))))))) is different from false [2018-12-01 19:49:25,367 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))))))) is different from true [2018-12-01 19:49:27,455 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse0 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0) .cse0))) c_main_~r~0) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) is different from false [2018-12-01 19:49:29,532 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse0 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0) .cse0))) c_main_~r~0) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) is different from true [2018-12-01 19:49:46,221 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_11) v_prenex_13)) .cse4)) (_ bv4294966273 32))) (_ bv1023 32))) .cse4))) ((_ extract 31 0) v_prenex_10)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse2))))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))))) (and .cse5 (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse6 (let ((.cse8 (concat ((_ extract 63 32) (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse9)) (_ bv4294966273 32))) (_ bv1023 32))) .cse9))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) (and (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (let ((.cse13 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse13)) (_ bv4294966273 32))) (_ bv1023 32))) .cse13))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) .cse11))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) .cse5))) is different from false [2018-12-01 19:50:00,891 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_11) v_prenex_13)) .cse4)) (_ bv4294966273 32))) (_ bv1023 32))) .cse4))) ((_ extract 31 0) v_prenex_10)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse2))))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))))) (and .cse5 (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse9)) (_ bv4294966273 32))) (_ bv1023 32))) .cse9))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse7))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) (and .cse5 (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse10 (let ((.cse12 (concat ((_ extract 63 32) (let ((.cse13 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse13)) (_ bv4294966273 32))) (_ bv1023 32))) .cse13))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse10) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse10) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))))) is different from false [2018-12-01 19:50:11,366 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from false [2018-12-01 19:50:13,462 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from true [2018-12-01 19:50:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:50:13,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:50:48,997 WARN L180 SmtUtils]: Spent 19.71 s on a formula simplification that was a NOOP. DAG size: 82 [2018-12-01 19:51:11,777 WARN L180 SmtUtils]: Spent 22.78 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-01 19:51:33,906 WARN L180 SmtUtils]: Spent 22.13 s on a formula simplification that was a NOOP. DAG size: 74 [2018-12-01 19:51:58,886 WARN L180 SmtUtils]: Spent 24.98 s on a formula simplification that was a NOOP. DAG size: 74 [2018-12-01 19:52:01,149 INFO L303 Elim1Store]: Index analysis took 2252 ms [2018-12-01 19:52:01,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 723 treesize of output 687 [2018-12-01 19:52:17,789 WARN L180 SmtUtils]: Spent 16.64 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-01 19:52:19,077 INFO L303 Elim1Store]: Index analysis took 1286 ms [2018-12-01 19:52:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 520 [2018-12-01 19:52:19,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:52:32,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:53:12,559 INFO L303 Elim1Store]: Index analysis took 1816 ms [2018-12-01 19:53:12,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 525 [2018-12-01 19:53:13,529 INFO L303 Elim1Store]: Index analysis took 968 ms [2018-12-01 19:53:13,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 474 [2018-12-01 19:53:26,153 WARN L180 SmtUtils]: Spent 12.62 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-01 19:53:28,417 INFO L303 Elim1Store]: Index analysis took 2263 ms [2018-12-01 19:53:28,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 241 [2018-12-01 19:53:28,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 19:53:32,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:53:42,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:54:22,002 INFO L303 Elim1Store]: Index analysis took 2243 ms [2018-12-01 19:54:22,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 723 treesize of output 687 [2018-12-01 19:54:37,200 WARN L180 SmtUtils]: Spent 15.19 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-01 19:54:39,455 INFO L303 Elim1Store]: Index analysis took 2255 ms [2018-12-01 19:54:39,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 520 [2018-12-01 19:54:39,457 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:54:54,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:55:34,476 INFO L303 Elim1Store]: Index analysis took 2250 ms [2018-12-01 19:55:34,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 525 [2018-12-01 19:55:36,232 INFO L303 Elim1Store]: Index analysis took 1754 ms [2018-12-01 19:55:36,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 474 [2018-12-01 19:55:48,882 WARN L180 SmtUtils]: Spent 12.65 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-01 19:55:51,159 INFO L303 Elim1Store]: Index analysis took 2276 ms [2018-12-01 19:55:51,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 241 [2018-12-01 19:55:51,160 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 19:55:55,356 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:12,195 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:50,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-01 19:56:50,501 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 16 variables, input treesize:1447, output treesize:529 [2018-12-01 19:56:52,551 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_21 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21)))) (or (not (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (not (= c_main_~a~0 .cse0)) (fp.geq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_21) v_arrayElimCell_5)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.leq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_16) v_arrayElimCell_8)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_5|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (not (= .cse5 c_main_~a~0)))))) is different from false [2018-12-01 19:56:54,732 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_21 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21)))) (or (not (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (not (= c_main_~a~0 .cse0)) (fp.geq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_21) v_arrayElimCell_5)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.leq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_16) v_arrayElimCell_8)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_5|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (not (= .cse5 c_main_~a~0)))))) is different from true [2018-12-01 19:56:54,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:56:54,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85db4fc3-0632-4716-b4f4-496ebee4dbc8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:56:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:56:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:55,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:56:56,004 WARN L180 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2018-12-01 19:56:56,076 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,077 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,078 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,079 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,130 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-12-01 19:56:56,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 171 [2018-12-01 19:56:56,379 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-01 19:56:56,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,422 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 130 [2018-12-01 19:56:56,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:56,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 108 [2018-12-01 19:56:56,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 97 [2018-12-01 19:56:56,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:56,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:56,730 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 156 [2018-12-01 19:56:56,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,874 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 159 [2018-12-01 19:56:56,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:56,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 195 [2018-12-01 19:56:56,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:57,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:57,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:57,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:57,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:57,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 160 [2018-12-01 19:56:57,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:57,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:57,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:57,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 119 [2018-12-01 19:56:57,630 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:57,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:56:58,169 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:56:58,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 112 [2018-12-01 19:56:58,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 74 [2018-12-01 19:56:58,186 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,257 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2018-12-01 19:56:58,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 95 [2018-12-01 19:56:58,635 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,672 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-01 19:56:58,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-12-01 19:56:58,689 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,716 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:56:58,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-12-01 19:56:58,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:58,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 124 [2018-12-01 19:56:58,790 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 8 xjuncts. [2018-12-01 19:56:58,950 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:56:59,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 80 [2018-12-01 19:56:59,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2018-12-01 19:56:59,248 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:59,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 148 [2018-12-01 19:56:59,381 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-12-01 19:56:59,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:56:59,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-01 19:56:59,591 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 19:56:59,717 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-01 19:56:59,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:57:00,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:57:00,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-01 19:57:00,129 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 8 variables, input treesize:216, output treesize:135 [2018-12-01 19:57:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 19:57:08,570 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:57:08,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 19:57:08,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-12-01 19:57:08,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 19:57:08,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 19:57:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=81, Unknown=22, NotChecked=138, Total=272 [2018-12-01 19:57:08,604 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-12-01 19:57:28,534 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |c_inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse5)) (_ bv4294966273 32))) (_ bv1023 32))) .cse5))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse3) .cse3))) c_inv_~xi~0) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |c_inv_#in~A|)))) is different from false [2018-12-01 19:57:30,858 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |c_inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse5)) (_ bv4294966273 32))) (_ bv1023 32))) .cse5))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse3) .cse3))) |c_inv_#res|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |c_inv_#in~A|)))) is different from false [2018-12-01 19:57:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:57:42,676 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-01 19:57:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:57:42,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-01 19:57:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:57:42,678 INFO L225 Difference]: With dead ends: 23 [2018-12-01 19:57:42,678 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 19:57:42,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=39, Invalid=98, Unknown=27, NotChecked=216, Total=380 [2018-12-01 19:57:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 19:57:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 19:57:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 19:57:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:57:42,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-01 19:57:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:57:42,680 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:57:42,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 19:57:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:57:42,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 19:57:42,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 19:57:42,747 INFO L451 ceAbstractionStarter]: At program point invENTRY(lines 19 37) the Hoare annotation is: true [2018-12-01 19:57:42,747 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 30 35) the Hoare annotation is: (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) [2018-12-01 19:57:42,747 INFO L448 ceAbstractionStarter]: For program point L30-3(lines 30 35) no Hoare annotation was computed. [2018-12-01 19:57:42,747 INFO L448 ceAbstractionStarter]: For program point invFINAL(lines 19 37) no Hoare annotation was computed. [2018-12-01 19:57:42,747 INFO L448 ceAbstractionStarter]: For program point invEXIT(lines 19 37) no Hoare annotation was computed. [2018-12-01 19:57:42,747 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 19:57:42,748 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: false [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (fp.leq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))) [2018-12-01 19:57:42,748 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 39 50) the Hoare annotation is: true [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 39 50) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 39 50) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-12-01 19:57:42,748 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-12-01 19:57:42,751 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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) [2018-12-01 19:57:42,752 INFO L168 Benchmark]: Toolchain (without parser) took 530651.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 943.4 MB in the beginning and 970.7 MB in the end (delta: -27.3 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-12-01 19:57:42,753 INFO L168 Benchmark]: CDTParser took 0.16 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-01 19:57:42,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:57:42,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.58 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 19:57:42,754 INFO L168 Benchmark]: Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:57:42,754 INFO L168 Benchmark]: RCFGBuilder took 2276.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-01 19:57:42,754 INFO L168 Benchmark]: TraceAbstraction took 528194.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 970.7 MB in the end (delta: 131.7 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:57:42,756 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.16 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 144.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 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 14.58 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2276.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 528194.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 970.7 MB in the end (delta: 131.7 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...