./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a .................................................................................................................................................................................................................................................................................................................................................................................. 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_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 12:21:49,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:49,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:49,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:49,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:49,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:49,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:49,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:49,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:49,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:49,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:49,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:49,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:49,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:49,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:49,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:49,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:49,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:49,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:49,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:49,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:49,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:49,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:49,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:49,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:49,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:49,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:49,527 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:49,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:49,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:49,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:49,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:49,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:49,530 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:49,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:49,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:49,531 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 12:21:49,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:49,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:49,543 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:21:49,543 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 12:21:49,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:21:49,544 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:21:49,544 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:21:49,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:49,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:21:49,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:21:49,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:21:49,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:49,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:21:49,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:49,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:49,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:21:49,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:21:49,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:21:49,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:49,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:21:49,548 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:21:49,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:21:49,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:21:49,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:21:49,548 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_4a420658-5392-4b84-aa71-f21cb7e026eb/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-11-18 12:21:49,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:49,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:49,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:49,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:49,585 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:49,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:49,630 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/fc1c402c0/222f3aeb36d54ffe88e1a614f4dfdf42/FLAGb4ff74f6f [2018-11-18 12:21:49,961 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:49,962 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:49,967 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/fc1c402c0/222f3aeb36d54ffe88e1a614f4dfdf42/FLAGb4ff74f6f [2018-11-18 12:21:49,977 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/fc1c402c0/222f3aeb36d54ffe88e1a614f4dfdf42 [2018-11-18 12:21:49,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:49,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:21:49,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:49,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:49,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:49,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:49" (1/1) ... [2018-11-18 12:21:49,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3328d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:49, skipping insertion in model container [2018-11-18 12:21:49,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:49" (1/1) ... [2018-11-18 12:21:49,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:50,009 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:50,130 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:50,136 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:50,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:50,169 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:50,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50 WrapperNode [2018-11-18 12:21:50,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:50,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:50,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:50,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:50,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... [2018-11-18 12:21:50,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:50,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:50,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:50,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:50,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-18 12:21:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:21:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-18 12:21:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 12:21:50,638 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:50,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:50 BoogieIcfgContainer [2018-11-18 12:21:50,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:50,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:21:50,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:21:50,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:21:50,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:21:49" (1/3) ... [2018-11-18 12:21:50,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a5b811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:50, skipping insertion in model container [2018-11-18 12:21:50,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:50" (2/3) ... [2018-11-18 12:21:50,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a5b811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:50, skipping insertion in model container [2018-11-18 12:21:50,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:50" (3/3) ... [2018-11-18 12:21:50,644 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:50,652 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:21:50,659 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:21:50,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:21:50,699 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:21:50,699 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:21:50,699 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:21:50,700 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:21:50,700 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:50,700 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:50,700 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:21:50,700 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:50,700 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:21:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-18 12:21:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:21:50,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:50,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:50,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:50,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1237723357, now seen corresponding path program 1 times [2018-11-18 12:21:50,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:50,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:50,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:50,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:21:50,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 12:21:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:21:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:50,866 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-18 12:21:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:50,882 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-18 12:21:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:21:50,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-18 12:21:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:50,889 INFO L225 Difference]: With dead ends: 130 [2018-11-18 12:21:50,890 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 12:21:50,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 12:21:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 12:21:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 12:21:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-18 12:21:50,922 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-18 12:21:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:50,923 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-18 12:21:50,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 12:21:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-18 12:21:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:21:50,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:50,924 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:50,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:50,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash -691387495, now seen corresponding path program 1 times [2018-11-18 12:21:50,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:50,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:50,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:50,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:50,999 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 3 states. [2018-11-18 12:21:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:51,012 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-18 12:21:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:51,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 12:21:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:51,014 INFO L225 Difference]: With dead ends: 68 [2018-11-18 12:21:51,014 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 12:21:51,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 12:21:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 12:21:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 12:21:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-18 12:21:51,021 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 30 [2018-11-18 12:21:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:51,021 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-18 12:21:51,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-18 12:21:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 12:21:51,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:51,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:51,022 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:51,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:51,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1286146192, now seen corresponding path program 1 times [2018-11-18 12:21:51,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:51,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:51,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:51,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:51,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:51,108 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:21:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:21:51 BoogieIcfgContainer [2018-11-18 12:21:51,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:21:51,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:21:51,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:21:51,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:21:51,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:50" (3/4) ... [2018-11-18 12:21:51,139 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:21:51,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:21:51,140 INFO L168 Benchmark]: Toolchain (without parser) took 1160.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -96.7 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:51,141 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:51,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:51,142 INFO L168 Benchmark]: Boogie Preprocessor took 85.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:51,143 INFO L168 Benchmark]: RCFGBuilder took 382.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:51,143 INFO L168 Benchmark]: TraceAbstraction took 496.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:51,144 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:51,146 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 382.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 496.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=15032385540, one_modf=1] [L144] double x = -1.0 / 0.0; [L145] FCALL double iptr = __VERIFIER_nondet_double(); [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=15032385547, iptr={15032385542:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=15032385547, iptr={15032385542:0}, iptr={15032385542:0}, one_modf=1, x=15032385547] [L24] FCALL ieee_double_shape_type ew_u; [L25] FCALL ew_u.value = (x) [L26] EXPR, FCALL ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR, FCALL ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L28] COND FALSE !(0) VAL [\old(x)=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, one_modf=1, x=15032385547] [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, one_modf=1, x=15032385547] [L30] COND TRUE j0 < 20 VAL [\old(x)=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, j0=-1, one_modf=1, x=15032385547] [L31] COND TRUE j0 < 0 VAL [\old(x)=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, j0=-1, one_modf=1, x=15032385547] [L33] FCALL ieee_double_shape_type iw_u; [L34] FCALL iw_u.parts.msw = (i0 & 0x80000000) [L35] FCALL iw_u.parts.lsw = (0) [L36] EXPR, FCALL iw_u.value [L36] FCALL (*iptr) = iw_u.value [L37] COND FALSE !(0) VAL [\old(x)=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, j0=-1, one_modf=1, x=15032385547] [L38] RET return x; VAL [\old(x)=15032385547, \result=15032385547, i0=-2147483648, i1=-2147483648, iptr={15032385542:0}, iptr={15032385542:0}, j0=-1, one_modf=1, x=15032385547] [L146] EXPR modf_double(x, &iptr) VAL [iptr={15032385542:0}, modf_double(x, &iptr)=15032385547, one_modf=1, x=15032385547] [L146] double res = modf_double(x, &iptr); [L149] EXPR, FCALL \read(iptr) VAL [\read(iptr)=15032385548, iptr={15032385542:0}, one_modf=1, res=15032385547, x=15032385547] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=15032385548, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=15032385548, one_modf=1, x=15032385548] [L114] FCALL ieee_double_shape_type ew_u; [L115] FCALL ew_u.value = (x) [L116] EXPR, FCALL ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR, FCALL ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L118] COND FALSE !(0) VAL [\old(x)=15032385548, hx=-2147483648, lx=-2147483648, one_modf=1, x=15032385548] [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] RET return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=15032385548, \result=2, hx=2146435073, lx=-2147483648, one_modf=1, x=15032385548] [L149] EXPR isinf_double(iptr) VAL [\read(iptr)=15032385548, iptr={15032385542:0}, isinf_double(iptr)=2, one_modf=1, res=15032385547, x=15032385547] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [\read(iptr)=15032385548, iptr={15032385542:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=15032385547, res == -0.0 && __signbit_double(res) == 1=0, x=15032385547] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=15032385548, iptr={15032385542:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=15032385547, res == -0.0 && __signbit_double(res) == 1=0, x=15032385547] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [iptr={15032385542:0}, one_modf=1, res=15032385547, x=15032385547] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 0 SDslu, 66 SDs, 0 SdLazy, 4 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=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 12:21:52,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:52,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:52,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:52,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:52,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:52,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:52,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:52,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:52,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:52,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:52,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:52,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:52,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:52,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:52,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:52,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:52,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:52,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:52,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:52,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:52,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:52,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:52,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:52,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:52,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:52,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:52,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:52,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:52,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:52,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:52,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:52,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:52,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:52,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:52,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:52,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 12:21:52,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:52,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:52,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:21:52,600 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 12:21:52,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:21:52,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:52,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:52,602 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:52,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:21:52,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:52,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:52,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:21:52,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:21:52,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:21:52,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 12:21:52,604 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 12:21:52,604 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_4a420658-5392-4b84-aa71-f21cb7e026eb/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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-11-18 12:21:52,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:52,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:52,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:52,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:52,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:52,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:52,695 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/381ea51ae/36c5707c4c8f424dbd702b3d8a258db3/FLAG040529de8 [2018-11-18 12:21:53,026 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:53,027 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/sv-benchmarks/c/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:53,031 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/381ea51ae/36c5707c4c8f424dbd702b3d8a258db3/FLAG040529de8 [2018-11-18 12:21:53,450 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/data/381ea51ae/36c5707c4c8f424dbd702b3d8a258db3 [2018-11-18 12:21:53,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:53,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:21:53,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:53,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:53,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:53,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765b70d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53, skipping insertion in model container [2018-11-18 12:21:53,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:53,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:53,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:53,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:53,663 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:53,678 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:53,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53 WrapperNode [2018-11-18 12:21:53,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:53,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:53,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:53,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:53,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... [2018-11-18 12:21:53,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:53,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:53,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:53,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:53,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-18 12:21:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-18 12:21:53,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 12:21:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 12:21:53,970 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:53,994 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,009 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,069 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,493 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,503 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,527 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,540 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,567 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,588 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,605 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,672 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,683 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 12:21:54,698 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:54,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:54 BoogieIcfgContainer [2018-11-18 12:21:54,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:54,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:21:54,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:21:54,703 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:21:54,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:21:53" (1/3) ... [2018-11-18 12:21:54,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebe6834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:54, skipping insertion in model container [2018-11-18 12:21:54,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:53" (2/3) ... [2018-11-18 12:21:54,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebe6834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:54, skipping insertion in model container [2018-11-18 12:21:54,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:54" (3/3) ... [2018-11-18 12:21:54,705 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-11-18 12:21:54,713 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:21:54,719 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:21:54,732 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:21:54,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:21:54,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:21:54,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:21:54,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:21:54,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:54,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:54,757 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:21:54,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:54,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:21:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-18 12:21:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:21:54,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:54,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:54,778 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:54,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1237723357, now seen corresponding path program 1 times [2018-11-18 12:21:54,786 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:21:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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-11-18 12:21:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:54,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:54,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:21:54,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:54,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:21:54,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 12:21:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:21:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:54,909 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-18 12:21:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:54,931 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-18 12:21:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:21:54,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-18 12:21:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:54,937 INFO L225 Difference]: With dead ends: 130 [2018-11-18 12:21:54,937 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 12:21:54,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:21:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 12:21:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 12:21:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 12:21:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-18 12:21:54,963 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-18 12:21:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:54,963 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-18 12:21:54,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 12:21:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-18 12:21:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:21:54,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:54,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:54,965 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:54,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash -691387495, now seen corresponding path program 1 times [2018-11-18 12:21:54,966 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:21:54,966 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/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-11-18 12:21:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:55,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:55,062 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:21:55,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:55,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:55,071 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 3 states. [2018-11-18 12:21:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:55,080 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-18 12:21:55,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:55,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 12:21:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:55,082 INFO L225 Difference]: With dead ends: 68 [2018-11-18 12:21:55,082 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 12:21:55,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-11-18 12:21:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 12:21:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 12:21:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 12:21:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-18 12:21:55,086 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 30 [2018-11-18 12:21:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:55,087 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-18 12:21:55,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-18 12:21:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 12:21:55,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:55,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:55,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:21:55,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1286146192, now seen corresponding path program 1 times [2018-11-18 12:21:55,089 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:21:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-18 12:21:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:55,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:55,344 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 12:21:55,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2018-11-18 12:21:55,373 INFO L477 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 85 treesize of output 67 [2018-11-18 12:21:55,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 64 [2018-11-18 12:21:55,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 64 treesize of output 51 [2018-11-18 12:21:55,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:55,506 INFO L477 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 2 case distinctions, treesize of input 51 treesize of output 62 [2018-11-18 12:21:55,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 12:21:55,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:21:55,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:21:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-11-18 12:21:55,669 INFO L477 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 65 treesize of output 52 [2018-11-18 12:21:55,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 12:21:55,694 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-11-18 12:21:55,768 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 12:21:55,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,797 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-18 12:21:55,900 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:98, output treesize:171 [2018-11-18 12:21:56,050 INFO L477 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 105 treesize of output 89 [2018-11-18 12:21:56,061 INFO L477 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 85 treesize of output 73 [2018-11-18 12:21:56,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:56,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:56,116 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2018-11-18 12:21:56,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:56,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:56,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:56,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2018-11-18 12:21:56,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:21:56,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-11-18 12:21:56,579 INFO L477 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 86 treesize of output 70 [2018-11-18 12:21:56,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2018-11-18 12:21:56,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:56,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:56,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 7 xjuncts. [2018-11-18 12:21:56,757 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:192, output treesize:357 [2018-11-18 12:21:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:57,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:21:57,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:21:57,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:21:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:21:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:21:57,185 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 11 states. [2018-11-18 12:22:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:08,009 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-18 12:22:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:22:08,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 12:22:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:08,011 INFO L225 Difference]: With dead ends: 84 [2018-11-18 12:22:08,011 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 12:22:08,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 12:22:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 12:22:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-18 12:22:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 12:22:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-18 12:22:08,032 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 32 [2018-11-18 12:22:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:08,032 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-18 12:22:08,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:22:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 12:22:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 12:22:08,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:08,033 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:22:08,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2118134929, now seen corresponding path program 1 times [2018-11-18 12:22:08,033 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:22:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-18 12:22:08,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:08,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:08,393 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 12:22:08,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-11-18 12:22:08,436 INFO L477 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 78 treesize of output 71 [2018-11-18 12:22:08,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-18 12:22:08,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-11-18 12:22:08,538 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 12:22:08,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2018-11-18 12:22:08,614 INFO L477 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 99 treesize of output 89 [2018-11-18 12:22:08,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-18 12:22:08,654 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,682 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:22:08,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 74 treesize of output 64 [2018-11-18 12:22:08,759 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:22:08,779 INFO L477 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 2 case distinctions, treesize of input 61 treesize of output 69 [2018-11-18 12:22:08,780 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 12:22:08,862 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:22:08,936 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:22:09,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-11-18 12:22:09,740 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:132, output treesize:245 [2018-11-18 12:22:25,915 WARN L180 SmtUtils]: Spent 16.13 s on a formula simplification. DAG size of input: 106 DAG size of output: 76 [2018-11-18 12:22:34,037 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-18 12:22:34,050 INFO L477 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 106 treesize of output 90 [2018-11-18 12:22:34,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2018-11-18 12:22:34,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:22:34,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:22:34,187 INFO L477 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 136 treesize of output 118 [2018-11-18 12:22:34,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:22:34,199 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 97 [2018-11-18 12:22:34,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:22:34,298 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 73 [2018-11-18 12:22:34,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:22:34,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:22:34,523 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:22:34,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 114 [2018-11-18 12:22:34,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:22:34,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 12:22:35,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 27 dim-0 vars, and 7 xjuncts. [2018-11-18 12:22:35,240 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:243, output treesize:538 [2018-11-18 12:22:38,531 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 226 DAG size of output: 31 [2018-11-18 12:22:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:38,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:22:38,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:38,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:22:38,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:22:38,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:22:38,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:22:38,923 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 14 states. [2018-11-18 12:22:56,170 WARN L180 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-11-18 12:23:05,338 WARN L180 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:23:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:06,298 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-18 12:23:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:23:06,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-18 12:23:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:06,301 INFO L225 Difference]: With dead ends: 85 [2018-11-18 12:23:06,301 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 12:23:06,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-18 12:23:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 12:23:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-11-18 12:23:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 12:23:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-18 12:23:06,310 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2018-11-18 12:23:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:06,311 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-18 12:23:06,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:23:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-18 12:23:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 12:23:06,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:06,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:06,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:06,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1555142629, now seen corresponding path program 1 times [2018-11-18 12:23:06,312 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:23:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-18 12:23:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:06,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:07,311 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-18 12:23:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 99 [2018-11-18 12:23:07,371 INFO L477 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 69 treesize of output 53 [2018-11-18 12:23:07,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 12:23:07,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,481 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:07,481 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:07,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 77 treesize of output 89 [2018-11-18 12:23:07,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:07,521 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-11-18 12:23:07,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2018-11-18 12:23:07,616 INFO L477 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 109 treesize of output 81 [2018-11-18 12:23:07,717 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 12:23:07,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2018-11-18 12:23:07,733 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:07,857 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:07,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:07,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 77 treesize of output 75 [2018-11-18 12:23:07,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:07,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:07,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:08,008 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-11-18 12:23:08,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 88 [2018-11-18 12:23:08,038 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:08,086 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:08,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:09,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-18 12:23:09,413 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:162, output treesize:176 [2018-11-18 12:23:09,715 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-11-18 12:23:09,827 INFO L477 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 114 treesize of output 96 [2018-11-18 12:23:09,841 INFO L477 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 92 treesize of output 82 [2018-11-18 12:23:09,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:09,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:09,993 INFO L477 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 82 treesize of output 62 [2018-11-18 12:23:09,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:10,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:23:10,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:10,146 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:10,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 102 [2018-11-18 12:23:10,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 12:23:10,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:23:10,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-18 12:23:10,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:133, output treesize:233 [2018-11-18 12:23:10,751 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2018-11-18 12:23:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:11,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:23:11,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:23:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:23:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:23:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:23:11,382 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 14 states. [2018-11-18 12:23:18,683 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-18 12:23:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:18,714 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-18 12:23:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:23:18,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-18 12:23:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:18,716 INFO L225 Difference]: With dead ends: 80 [2018-11-18 12:23:18,716 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 12:23:18,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-18 12:23:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 12:23:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-18 12:23:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 12:23:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-18 12:23:18,723 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 33 [2018-11-18 12:23:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:18,723 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-18 12:23:18,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:23:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-18 12:23:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 12:23:18,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:18,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:18,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:18,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -762413193, now seen corresponding path program 1 times [2018-11-18 12:23:18,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:23:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-18 12:23:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:18,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:18,991 INFO L477 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 51 treesize of output 45 [2018-11-18 12:23:18,992 INFO L477 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 45 treesize of output 38 [2018-11-18 12:23:19,002 INFO L477 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 29 treesize of output 21 [2018-11-18 12:23:19,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:19,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-18 12:23:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:19,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:23:19,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:19,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:23:19,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:23:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:23:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:23:19,074 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-11-18 12:23:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:19,568 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-18 12:23:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:23:19,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 12:23:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:19,569 INFO L225 Difference]: With dead ends: 60 [2018-11-18 12:23:19,569 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 12:23:19,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:23:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 12:23:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-18 12:23:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 12:23:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-18 12:23:19,576 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 34 [2018-11-18 12:23:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:19,577 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-18 12:23:19,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:23:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-18 12:23:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:23:19,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:19,578 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:19,578 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:19,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1747703387, now seen corresponding path program 1 times [2018-11-18 12:23:19,578 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:23:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 12:23:19,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:19,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:19,913 INFO L477 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 54 treesize of output 48 [2018-11-18 12:23:19,915 INFO L477 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 48 treesize of output 39 [2018-11-18 12:23:19,926 INFO L477 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 30 treesize of output 24 [2018-11-18 12:23:19,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:19,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:19,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-18 12:23:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:20,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:23:20,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:20,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 12:23:20,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 12:23:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 12:23:20,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:23:20,297 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 15 states. [2018-11-18 12:23:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:25,947 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-18 12:23:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:23:25,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-18 12:23:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:25,948 INFO L225 Difference]: With dead ends: 69 [2018-11-18 12:23:25,948 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 12:23:25,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-11-18 12:23:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 12:23:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-18 12:23:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 12:23:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-18 12:23:25,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 42 [2018-11-18 12:23:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:25,954 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-18 12:23:25,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 12:23:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-18 12:23:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:23:25,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:23:25,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:25,955 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:23:25,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2078604707, now seen corresponding path program 1 times [2018-11-18 12:23:25,956 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:23:25,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a420658-5392-4b84-aa71-f21cb7e026eb/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-18 12:23:25,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:26,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:26,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:26,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:23:26,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-18 12:23:26,218 INFO L477 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 27 treesize of output 24 [2018-11-18 12:23:26,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:26,229 INFO L477 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 24 treesize of output 18 [2018-11-18 12:23:26,233 INFO L477 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 18 treesize of output 4 [2018-11-18 12:23:26,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:23:26,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:26,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:23:26,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:23:26,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-18 12:23:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:26,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:23:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:26,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:23:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:23:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:23:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:23:26,334 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 7 states. [2018-11-18 12:23:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:26,754 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-18 12:23:26,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:23:26,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-18 12:23:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:23:26,756 INFO L225 Difference]: With dead ends: 51 [2018-11-18 12:23:26,756 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:23:26,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:23:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:23:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:23:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:23:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:23:26,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-11-18 12:23:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:23:26,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:26,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:23:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:23:26,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:23:26,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:23:26,980 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-18 12:23:27,114 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-18 12:23:27,261 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-18 12:23:27,985 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-18 12:23:28,439 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 125 [2018-11-18 12:23:28,598 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-18 12:23:45,527 WARN L180 SmtUtils]: Spent 16.84 s on a formula simplification. DAG size of input: 242 DAG size of output: 233 [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point isnan_doubleENTRY(line 16) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L425 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 111 123) no Hoare annotation was computed. [2018-11-18 12:23:45,532 INFO L421 ceAbstractionStarter]: At program point L113-3(lines 113 118) the Hoare annotation is: (= isinf_double_~x |isinf_double_#in~x|) [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point L113-4(lines 113 118) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 111 123) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L428 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 111 123) the Hoare annotation is: true [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L421 ceAbstractionStarter]: At program point L128-3(lines 128 132) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point L128-4(lines 128 132) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 125 135) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 125 135) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L428 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 125 135) the Hoare annotation is: true [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 12:23:45,533 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:23:45,533 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 137 155) no Hoare annotation was computed. [2018-11-18 12:23:45,534 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-18 12:23:45,534 INFO L421 ceAbstractionStarter]: At program point L149(line 149) the Hoare annotation is: (let ((.cse4 (= (bvadd |main_~#iptr~0.offset| (_ bv4 32)) (_ bv0 32)))) (or (and (exists ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 64)) (v_prenex_55 (_ BitVec 32))) (let ((.cse2 ((_ extract 63 32) v_prenex_53))) (let ((.cse0 (let ((.cse3 (concat .cse2 (bvand v_prenex_54 (bvnot v_prenex_55))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))) (.cse1 (bvadd (bvand (_ bv2047 32) (bvashr .cse2 (_ bv20 32))) (_ bv4294966273 32)))) (and (= .cse0 (fp ((_ extract 63 63) v_prenex_53) ((_ extract 62 52) v_prenex_53) ((_ extract 51 0) v_prenex_53))) (= .cse0 |main_#t~mem29|) (not (bvslt .cse1 (_ bv20 32))) (not (bvsgt .cse1 (_ bv51 32))))))) (or (and .cse4 (exists ((modf_double_~i1~0 (_ BitVec 32)) (modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_15| (_ BitVec 64)) (modf_double_~i~0 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |main_~#iptr~0.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_15|)) (.cse8 (bvadd (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) (let ((.cse5 (concat modf_double_~i0~0 (bvand modf_double_~i1~0 (bvnot modf_double_~i~0))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))) (= (select .cse6 (bvadd |main_~#iptr~0.offset| (_ bv4 32))) .cse7) (not (bvsgt .cse8 (_ bv51 32))) (= (select .cse6 (_ bv4 32)) .cse7) (not (bvslt .cse8 (_ bv20 32))))))) (exists ((|v_modf_double_~#iw_u~5.base_4| (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (v_prenex_45 (_ BitVec 32)) (v_prenex_44 (_ BitVec 64))) (let ((.cse9 (select |#memory_int| |v_modf_double_~#iw_u~5.base_4|))) (let ((.cse13 (select .cse9 (_ bv4 32)))) (let ((.cse11 (bvadd (bvand (_ bv2047 32) (bvashr .cse13 (_ bv20 32))) (_ bv4294966273 32))) (.cse10 (bvand v_prenex_43 (bvnot v_prenex_45)))) (and (= (select .cse9 (_ bv0 32)) .cse10) (not (bvslt .cse11 (_ bv20 32))) (not (bvsgt .cse11 (_ bv51 32))) (= ((_ extract 63 32) v_prenex_44) (select (select |#memory_int| |main_~#iptr~0.base|) (bvadd |main_~#iptr~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) v_prenex_44) ((_ extract 62 52) v_prenex_44) ((_ extract 51 0) v_prenex_44)) (let ((.cse12 (concat .cse13 .cse10))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))))))))) (and (exists ((|v_modf_double_~#iw_u~2.base_4| (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_prenex_67 (_ BitVec 64)) (v_prenex_68 (_ BitVec 32))) (let ((.cse18 (select |#memory_int| |v_modf_double_~#iw_u~2.base_4|))) (let ((.cse14 (select .cse18 (_ bv4 32))) (.cse17 (bvadd (bvand (_ bv2047 32) (bvashr v_prenex_66 (_ bv20 32))) (_ bv4294966273 32))) (.cse16 (select |#memory_int| |main_~#iptr~0.base|))) (and (= .cse14 (bvand v_prenex_66 (bvnot v_prenex_68))) (= (let ((.cse15 (concat .cse14 (_ bv0 32)))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))) (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67))) (= (select .cse16 (bvadd |main_~#iptr~0.offset| (_ bv4 32))) ((_ extract 63 32) v_prenex_67)) (not (bvslt .cse17 (_ bv0 32))) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (bvslt .cse17 (_ bv20 32)) (= ((_ extract 31 0) v_prenex_67) (select .cse16 |main_~#iptr~0.offset|)))))) (exists ((v_prenex_66 (_ BitVec 32)) (v_prenex_67 (_ BitVec 64)) (v_prenex_68 (_ BitVec 32))) (let ((.cse20 (bvand v_prenex_66 (bvnot v_prenex_68))) (.cse21 (bvadd (bvand (_ bv2047 32) (bvashr v_prenex_66 (_ bv20 32))) (_ bv4294966273 32)))) (and (= (let ((.cse19 (concat .cse20 (_ bv0 32)))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))) (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67))) (not (bvslt .cse21 (_ bv0 32))) (= (let ((.cse22 (concat .cse20 ((_ extract 31 0) v_prenex_67)))) (fp ((_ extract 63 63) .cse22) ((_ extract 62 52) .cse22) ((_ extract 51 0) .cse22))) |main_#t~mem29|) (bvslt .cse21 (_ bv20 32)))))) (and (or (and .cse4 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse23 ((_ extract 63 32) |v_q#valueAsBitvector_14|)) (.cse24 (select |#memory_int| |main_~#iptr~0.base|))) (and (= .cse23 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse23 (select .cse24 (_ bv4 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse25 (concat .cse23 (_ bv0 32)))) (fp ((_ extract 63 63) .cse25) ((_ extract 62 52) .cse25) ((_ extract 51 0) .cse25)))) (= .cse23 (select .cse24 (bvadd |main_~#iptr~0.offset| (_ bv4 32)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse28 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse27 (select .cse28 (_ bv4 32)))) (and (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |main_~#iptr~0.base|) (bvadd |main_~#iptr~0.offset| (_ bv4 32)))) (= (let ((.cse26 (concat .cse27 (_ bv0 32)))) (fp ((_ extract 63 63) .cse26) ((_ extract 62 52) .cse26) ((_ extract 51 0) .cse26))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse28 (_ bv0 32)) (_ bv0 32)) (= .cse27 (bvand (_ bv2147483648 32) v_prenex_20))))))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse29 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse29 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= |main_#t~mem29| (let ((.cse30 (concat .cse29 v_arrayElimCell_10))) (fp ((_ extract 63 63) .cse30) ((_ extract 62 52) .cse30) ((_ extract 51 0) .cse30)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse31 (concat .cse29 (_ bv0 32)))) (fp ((_ extract 63 63) .cse31) ((_ extract 62 52) .cse31) ((_ extract 51 0) .cse31)))))))) (and (exists ((v_prenex_76 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_76) ((_ extract 62 52) v_prenex_76) ((_ extract 51 0) v_prenex_76)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (let ((.cse32 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_76)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse32) ((_ extract 62 52) .cse32) ((_ extract 51 0) .cse32))) main_~res~0))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0)))) [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-2(line 149) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L421 ceAbstractionStarter]: At program point L149-4(line 149) the Hoare annotation is: (and (exists ((v_prenex_76 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_76) ((_ extract 62 52) v_prenex_76) ((_ extract 51 0) v_prenex_76)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_76)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) |main_#t~short32|) [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-5(line 149) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-7(line 149) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 137 155) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L149-9(lines 149 152) no Hoare annotation was computed. [2018-11-18 12:23:45,535 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 137 155) the Hoare annotation is: true [2018-11-18 12:23:45,535 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-18 12:23:45,536 INFO L421 ceAbstractionStarter]: At program point L146(line 146) the Hoare annotation is: (and (exists ((|v_modf_double_~#iw_u~2.base_4| (_ BitVec 32)) (v_prenex_66 (_ BitVec 32)) (v_prenex_67 (_ BitVec 64)) (v_prenex_68 (_ BitVec 32))) (let ((.cse4 (select |#memory_int| |v_modf_double_~#iw_u~2.base_4|))) (let ((.cse0 (select .cse4 (_ bv4 32))) (.cse3 (bvadd (bvand (_ bv2047 32) (bvashr v_prenex_66 (_ bv20 32))) (_ bv4294966273 32))) (.cse2 (select |#memory_int| |main_~#iptr~0.base|))) (and (= .cse0 (bvand v_prenex_66 (bvnot v_prenex_68))) (= (let ((.cse1 (concat .cse0 (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67))) (= (select .cse2 (bvadd |main_~#iptr~0.offset| (_ bv4 32))) ((_ extract 63 32) v_prenex_67)) (not (bvslt .cse3 (_ bv0 32))) (= (_ bv0 32) (select .cse4 (_ bv0 32))) (bvslt .cse3 (_ bv20 32)) (= ((_ extract 31 0) v_prenex_67) (select .cse2 |main_~#iptr~0.offset|)))))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse7 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse6 (select .cse7 (_ bv4 32)))) (and (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |main_~#iptr~0.base|) (bvadd |main_~#iptr~0.offset| (_ bv4 32)))) (= (let ((.cse5 (concat .cse6 (_ bv0 32)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= .cse6 (bvand (_ bv2147483648 32) v_prenex_20))))))) [2018-11-18 12:23:45,536 INFO L425 ceAbstractionStarter]: For program point L146-1(line 146) no Hoare annotation was computed. [2018-11-18 12:23:45,536 INFO L425 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2018-11-18 12:23:45,536 INFO L421 ceAbstractionStarter]: At program point L44-3(lines 44 48) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse1 (select .cse2 (_ bv4 32))) (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse6 (_ bv4 32)))) (and (= (let ((.cse4 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (bvslt modf_double_~j0~0 (_ bv20 32)) (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_18|) (_ bv20 32)))))) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= modf_double_~i0~0 ((_ extract 63 32) |v_q#valueAsBitvector_18|)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32)))) (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse7 (select .cse8 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse10 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse10 (_ bv4 32)))) (or (not (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse12 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))))) [2018-11-18 12:23:45,536 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2018-11-18 12:23:45,537 INFO L421 ceAbstractionStarter]: At program point L69-3(lines 69 73) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse1 (select .cse2 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse4 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse4 (_ bv4 32)))) (or (not (= (select .cse4 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse6 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))) (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse7 (select .cse8 (_ bv4 32))) (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse12 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse12 (_ bv4 32)))) (and (= (let ((.cse10 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse12 (_ bv0 32)) (_ bv0 32)) (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32)))) (= |modf_double_#in~x| modf_double_~x) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset) (not (bvslt modf_double_~j0~0 (_ bv20 32)))))) [2018-11-18 12:23:45,537 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2018-11-18 12:23:45,537 INFO L421 ceAbstractionStarter]: At program point L86-3(lines 86 90) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse1 (select .cse2 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse4 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse4 (_ bv4 32)))) (or (not (= (select .cse4 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse6 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))) (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse7 (select .cse8 (_ bv4 32))) (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse12 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse12 (_ bv4 32)))) (and (= (let ((.cse10 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse12 (_ bv0 32)) (_ bv0 32)) (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_18|) (_ bv20 32)))))) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (not (bvsgt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_18|) (_ bv20 32))) (_ bv4294966273 32)) (_ bv51 32))))) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= modf_double_~i0~0 ((_ extract 63 32) |v_q#valueAsBitvector_18|)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))))) [2018-11-18 12:23:45,537 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2018-11-18 12:23:45,537 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2018-11-18 12:23:45,537 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2018-11-18 12:23:45,538 INFO L421 ceAbstractionStarter]: At program point L23-3(lines 23 28) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse1 (select .cse2 (_ bv4 32))) (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse6 (_ bv4 32)))) (and (= (let ((.cse4 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= |modf_double_#in~x| modf_double_~x) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset)) (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse7 (select .cse8 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse10 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse10 (_ bv4 32)))) (or (not (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse12 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))))) [2018-11-18 12:23:45,538 INFO L425 ceAbstractionStarter]: For program point L23-4(lines 23 28) no Hoare annotation was computed. [2018-11-18 12:23:45,538 INFO L425 ceAbstractionStarter]: For program point modf_doubleFINAL(lines 20 108) no Hoare annotation was computed. [2018-11-18 12:23:45,538 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-11-18 12:23:45,538 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 37) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse1 (select .cse2 (_ bv4 32))) (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse6 (_ bv4 32)))) (and (= (let ((.cse4 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset)) (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse7 (select .cse8 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse10 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse10 (_ bv4 32)))) (or (not (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse12 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))))) [2018-11-18 12:23:45,538 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 37) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L421 ceAbstractionStarter]: At program point L57-3(lines 57 62) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse1 (select .cse2 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse4 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse4 (_ bv4 32)))) (or (not (= (select .cse4 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse6 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))) (let ((.cse13 (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32))))) (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse7 (select .cse8 (_ bv4 32))) (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse12 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse12 (_ bv4 32)))) (and (= (let ((.cse10 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse12 (_ bv0 32)) (_ bv0 32)) (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= (bvadd modf_double_~j0~0 (_ bv1023 32)) .cse13) (bvslt modf_double_~j0~0 (_ bv20 32)) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset) (not (bvslt (bvadd .cse13 (_ bv4294966273 32)) (_ bv0 32))))))) [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L57-4(lines 57 62) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L49-2(lines 41 56) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L49-3(lines 49 54) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 66 81) no Hoare annotation was computed. [2018-11-18 12:23:45,539 INFO L425 ceAbstractionStarter]: For program point L74-3(lines 74 79) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L421 ceAbstractionStarter]: At program point L99-3(lines 99 104) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (let ((.cse7 (bvand (_ bv2047 32) (bvashr modf_double_~i0~0 (_ bv20 32))))) (let ((.cse8 (bvadd .cse7 (_ bv4294966273 32)))) (and (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse1 (select .cse2 (_ bv4 32))) (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse6 (_ bv4 32)))) (and (= (let ((.cse4 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))))))) (= |modf_double_#in~iptr.base| modf_double_~iptr.base) (= (bvadd modf_double_~j0~0 (_ bv1023 32)) .cse7) (= |modf_double_#in~iptr.offset| modf_double_~iptr.offset) (not (bvsgt .cse8 (_ bv51 32))) (not (bvslt .cse8 (_ bv20 32)))))) (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse10 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse9 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse9 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse9 (select .cse10 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse9 (select .cse10 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse11 (concat .cse9 (_ bv0 32)))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse12 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (or (not (= (select .cse12 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse13 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse14 (concat .cse13 (_ bv0 32)))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))))) [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L99-4(lines 99 104) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 83 98) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L91-3(lines 91 96) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2018-11-18 12:23:45,540 INFO L425 ceAbstractionStarter]: For program point modf_doubleEXIT(lines 20 108) no Hoare annotation was computed. [2018-11-18 12:23:45,541 INFO L421 ceAbstractionStarter]: At program point modf_doubleENTRY(lines 20 108) the Hoare annotation is: (let ((.cse0 (= (_ bv4294967292 32) |modf_double_#in~iptr.offset|))) (or (and .cse0 (exists ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |modf_double_#in~iptr.base|)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (and (= .cse1 (select .cse2 (_ bv4 32))) (= .cse1 (bvand (_ bv2147483648 32) modf_double_~i0~0)) (= .cse1 (select .cse2 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse3 (concat .cse1 (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) (exists ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse6 (select |#memory_int| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse5 (select .cse6 (_ bv4 32)))) (and (= (let ((.cse4 (concat .cse5 (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (= .cse5 (bvand (_ bv2147483648 32) v_prenex_20)) (= ((_ extract 63 32) v_prenex_21) (select (select |#memory_int| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32)))))))) (and (or (not .cse0) (forall ((modf_double_~i0~0 (_ BitVec 32)) (|v_q#valueAsBitvector_14| (_ BitVec 64))) (let ((.cse8 (select |old(#memory_int)| |modf_double_#in~iptr.base|)) (.cse7 ((_ extract 63 32) |v_q#valueAsBitvector_14|))) (or (not (= .cse7 (bvand (_ bv2147483648 32) modf_double_~i0~0))) (not (= .cse7 (select .cse8 (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse7 (select .cse8 (_ bv4 32)))) (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) (let ((.cse9 (concat .cse7 (_ bv0 32)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))))))) (forall ((v_prenex_21 (_ BitVec 64)) (|v_modf_double_~#iw_u~0.base_4| (_ BitVec 32)) (v_prenex_20 (_ BitVec 32))) (let ((.cse10 (select |old(#memory_int)| |v_modf_double_~#iw_u~0.base_4|))) (let ((.cse11 (select .cse10 (_ bv4 32)))) (or (not (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (not (= ((_ extract 63 32) v_prenex_21) (select (select |old(#memory_int)| |modf_double_#in~iptr.base|) (bvadd |modf_double_#in~iptr.offset| (_ bv4 32))))) (not (= .cse11 (bvand (_ bv2147483648 32) v_prenex_20))) (not (= (let ((.cse12 (concat .cse11 (_ bv0 32)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))))))))))) [2018-11-18 12:23:45,544 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:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) 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.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) 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:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) 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:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-18 12:23:45,547 INFO L168 Benchmark]: Toolchain (without parser) took 112093.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 951.9 MB in the beginning and 879.4 MB in the end (delta: 72.4 MB). Peak memory consumption was 360.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:45,547 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:45,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:45,548 INFO L168 Benchmark]: Boogie Preprocessor took 51.93 ms. Allocated memory is still 1.0 GB. Free memory was 935.8 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:45,548 INFO L168 Benchmark]: RCFGBuilder took 967.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -128.5 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:45,548 INFO L168 Benchmark]: TraceAbstraction took 110845.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 879.4 MB in the end (delta: 179.5 MB). Peak memory consumption was 350.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:45,550 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.93 ms. Allocated memory is still 1.0 GB. Free memory was 935.8 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 967.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -128.5 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110845.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 879.4 MB in the end (delta: 179.5 MB). Peak memory consumption was 350.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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. Received shutdown request...