./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ...................................................................................................................................................................................................................................................................................................................................................................... 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_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:25:12,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:25:12,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:25:12,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:25:12,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:25:12,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:25:12,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:25:12,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:25:12,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:25:12,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:25:12,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:25:12,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:25:12,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:25:12,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:25:12,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:25:12,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:25:12,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:25:12,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:25:12,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:25:12,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:25:12,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:25:12,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:25:12,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:25:12,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:25:12,365 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:25:12,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:25:12,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:25:12,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:25:12,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:25:12,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:25:12,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:25:12,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:25:12,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:25:12,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:25:12,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:25:12,370 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:25:12,371 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:25:12,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:25:12,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:25:12,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:25:12,382 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:25:12,382 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:25:12,382 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:25:12,382 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:25:12,382 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:25:12,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:25:12,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:25:12,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:25:12,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:25:12,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:25:12,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:25:12,386 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:25:12,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:25:12,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:25:12,386 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:25:12,386 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-09 12:25:12,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:25:12,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:25:12,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:25:12,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:25:12,421 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:25:12,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:12,461 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/2bd823ef8/a7a1adfaffa9439398dc837c5f8c65e6/FLAG2a23d1151 [2018-12-09 12:25:12,861 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:25:12,862 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:12,865 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/2bd823ef8/a7a1adfaffa9439398dc837c5f8c65e6/FLAG2a23d1151 [2018-12-09 12:25:12,873 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/2bd823ef8/a7a1adfaffa9439398dc837c5f8c65e6 [2018-12-09 12:25:12,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:25:12,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:25:12,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:25:12,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:25:12,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:25:12,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:12" (1/1) ... [2018-12-09 12:25:12,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:12, skipping insertion in model container [2018-12-09 12:25:12,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:12" (1/1) ... [2018-12-09 12:25:12,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:25:12,901 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:25:12,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:25:12,996 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:25:13,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:25:13,017 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:25:13,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13 WrapperNode [2018-12-09 12:25:13,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:25:13,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:25:13,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:25:13,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:25:13,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:25:13,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:25:13,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:25:13,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:25:13,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... [2018-12-09 12:25:13,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:25:13,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:25:13,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:25:13,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:25:13,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:25:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:25:13,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:25:13,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:25:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:25:13,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:25:13,224 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:25:13,225 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 12:25:13,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:13 BoogieIcfgContainer [2018-12-09 12:25:13,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:25:13,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:25:13,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:25:13,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:25:13,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:25:12" (1/3) ... [2018-12-09 12:25:13,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73932aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:13, skipping insertion in model container [2018-12-09 12:25:13,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:13" (2/3) ... [2018-12-09 12:25:13,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73932aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:13, skipping insertion in model container [2018-12-09 12:25:13,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:13" (3/3) ... [2018-12-09 12:25:13,229 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:13,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:25:13,243 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 12:25:13,258 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 12:25:13,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:25:13,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:25:13,281 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:25:13,281 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:25:13,281 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:25:13,281 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:25:13,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:25:13,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:25:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 12:25:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:13,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:13,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:13,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:13,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-09 12:25:13,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:25:13,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:13,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:13,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:13,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:13,412 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-09 12:25:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:13,462 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-12-09 12:25:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:25:13,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 12:25:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:13,469 INFO L225 Difference]: With dead ends: 75 [2018-12-09 12:25:13,469 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 12:25:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 12:25:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-12-09 12:25:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 12:25:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-09 12:25:13,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-09 12:25:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 12:25:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-09 12:25:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:13,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:13,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:13,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:13,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-12-09 12:25:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:25:13,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:13,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:13,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:25:13,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:13,528 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-09 12:25:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:13,555 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-12-09 12:25:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:13,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 12:25:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:13,557 INFO L225 Difference]: With dead ends: 50 [2018-12-09 12:25:13,557 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 12:25:13,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 12:25:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-12-09 12:25:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 12:25:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-09 12:25:13,561 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-09 12:25:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:13,562 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-09 12:25:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-09 12:25:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:13,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:13,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:13,562 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:13,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-12-09 12:25:13,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:25:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:25:13,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:25:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:25:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:25:13,587 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:25:13,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:25:13 BoogieIcfgContainer [2018-12-09 12:25:13,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:25:13,605 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:25:13,605 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:25:13,605 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:25:13,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:13" (3/4) ... [2018-12-09 12:25:13,608 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 12:25:13,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:25:13,608 INFO L168 Benchmark]: Toolchain (without parser) took 732.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 953.4 MB in the beginning and 1.0 GB in the end (delta: -62.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,609 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:25:13,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.4 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.81 ms. Allocated memory is still 1.0 GB. Free memory was 942.7 MB in the beginning and 937.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,610 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,610 INFO L168 Benchmark]: RCFGBuilder took 143.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,611 INFO L168 Benchmark]: TraceAbstraction took 379.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:25:13,611 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:25:13,613 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.4 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.81 ms. Allocated memory is still 1.0 GB. Free memory was 942.7 MB in the beginning and 937.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 379.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:25:14,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:25:14,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:25:14,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:25:14,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:25:14,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:25:14,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:25:14,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:25:14,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:25:14,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:25:14,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:25:14,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:25:14,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:25:14,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:25:14,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:25:14,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:25:14,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:25:14,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:25:14,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:25:14,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:25:14,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:25:14,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:25:14,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:25:14,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:25:14,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:25:14,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:25:14,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:25:14,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:25:14,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:25:14,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:25:14,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:25:14,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:25:14,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:25:14,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:25:14,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:25:14,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:25:14,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 12:25:14,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:25:14,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:25:14,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:25:14,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:25:14,967 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:25:14,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:25:14,967 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:25:14,967 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:25:14,967 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:25:14,967 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:25:14,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:25:14,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:25:14,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:25:14,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:25:14,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:25:14,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:25:14,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:25:14,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:25:14,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 12:25:14,971 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 12:25:14,972 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_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-09 12:25:14,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:25:14,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:25:14,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:25:15,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:25:15,000 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:25:15,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:15,036 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/157397fc0/11b8c57345044256902c09bb46aba0de/FLAG80df26e86 [2018-12-09 12:25:15,466 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:25:15,467 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:15,470 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/157397fc0/11b8c57345044256902c09bb46aba0de/FLAG80df26e86 [2018-12-09 12:25:15,478 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/data/157397fc0/11b8c57345044256902c09bb46aba0de [2018-12-09 12:25:15,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:25:15,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:25:15,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:25:15,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:25:15,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:25:15,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4428e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15, skipping insertion in model container [2018-12-09 12:25:15,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:25:15,500 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:25:15,594 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:25:15,599 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:25:15,614 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:25:15,623 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:25:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15 WrapperNode [2018-12-09 12:25:15,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:25:15,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:25:15,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:25:15,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:25:15,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:25:15,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:25:15,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:25:15,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:25:15,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... [2018-12-09 12:25:15,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:25:15,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:25:15,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:25:15,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:25:15,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:25:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:25:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:25:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:25:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:25:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:25:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:25:24,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:25:24,078 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 12:25:24,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:24 BoogieIcfgContainer [2018-12-09 12:25:24,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:25:24,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:25:24,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:25:24,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:25:24,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:25:15" (1/3) ... [2018-12-09 12:25:24,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381a8a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:24, skipping insertion in model container [2018-12-09 12:25:24,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:25:15" (2/3) ... [2018-12-09 12:25:24,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381a8a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:25:24, skipping insertion in model container [2018-12-09 12:25:24,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:25:24" (3/3) ... [2018-12-09 12:25:24,083 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 12:25:24,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:25:24,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 12:25:24,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 12:25:24,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:25:24,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:25:24,119 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:25:24,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:25:24,119 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:25:24,119 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:25:24,120 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:25:24,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:25:24,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:25:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 12:25:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:24,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:24,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:24,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-09 12:25:24,140 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:25:24,140 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-09 12:25:24,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:25,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:25:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:25:25,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:25:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:25,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:25,996 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-09 12:25:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:30,653 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-12-09 12:25:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:30,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 12:25:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:30,661 INFO L225 Difference]: With dead ends: 70 [2018-12-09 12:25:30,661 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 12:25:30,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 12:25:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-12-09 12:25:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 12:25:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-09 12:25:30,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-09 12:25:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:30,689 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 12:25:30,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-09 12:25:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:30,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:30,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:30,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:30,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-12-09 12:25:30,690 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:25:30,690 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-09 12:25:30,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:31,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:25:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:25:31,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:25:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:31,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:31,875 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-09 12:25:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:39,380 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-12-09 12:25:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:25:39,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 12:25:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:39,381 INFO L225 Difference]: With dead ends: 48 [2018-12-09 12:25:39,381 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 12:25:39,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 12:25:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 12:25:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 12:25:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-09 12:25:39,386 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-09 12:25:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:39,386 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-09 12:25:39,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-09 12:25:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:25:39,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:39,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:25:39,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:39,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-12-09 12:25:39,388 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:25:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-09 12:25:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:40,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:25:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:25:40,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:25:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:25:40,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:25:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:25:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:40,600 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-12-09 12:25:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:50,559 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-12-09 12:25:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:50,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 12:25:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:50,561 INFO L225 Difference]: With dead ends: 55 [2018-12-09 12:25:50,561 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 12:25:50,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:25:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 12:25:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-09 12:25:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 12:25:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-09 12:25:50,566 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-12-09 12:25:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:50,566 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-09 12:25:50,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:25:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-09 12:25:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 12:25:50,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:50,567 INFO L402 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] [2018-12-09 12:25:50,567 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:50,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-12-09 12:25:50,567 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:25:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-09 12:25:50,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:25:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:25:53,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:25:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 12:25:53,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:25:53,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:25:53,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:25:53,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:25:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:25:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:25:53,921 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-12-09 12:25:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:25:58,556 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-12-09 12:25:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:25:58,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 12:25:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:25:58,558 INFO L225 Difference]: With dead ends: 54 [2018-12-09 12:25:58,558 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 12:25:58,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:25:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 12:25:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-12-09 12:25:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 12:25:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-09 12:25:58,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-12-09 12:25:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:25:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-09 12:25:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:25:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-09 12:25:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 12:25:58,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:25:58,565 INFO L402 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] [2018-12-09 12:25:58,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:25:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:25:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-12-09 12:25:58,566 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:25:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/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-12-09 12:25:58,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:26:01,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:26:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:26:01,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:26:04,256 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-09 12:26:08,091 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 12:26:10,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 12:26:13,051 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 12:26:15,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 12:26:17,881 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 12:26:20,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 12:26:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-09 12:26:20,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:26:20,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:26:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:26:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-09 12:26:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:26:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 12:26:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:26:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:26:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-12-09 12:26:33,943 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-12-09 12:26:36,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-09 12:26:38,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:26:41,393 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:27:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:27:07,897 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-12-09 12:27:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:27:08,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-09 12:27:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:27:08,218 INFO L225 Difference]: With dead ends: 101 [2018-12-09 12:27:08,218 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 12:27:08,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-12-09 12:27:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 12:27:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-12-09 12:27:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 12:27:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-12-09 12:27:08,229 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-12-09 12:27:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:27:08,229 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-12-09 12:27:08,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:27:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-12-09 12:27:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:27:08,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:27:08,230 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:27:08,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:27:08,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-12-09 12:27:08,231 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:27:08,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/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-12-09 12:27:08,237 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 12:27:13,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 12:27:13,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:27:13,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:27:15,945 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:27:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-09 12:27:16,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:27:18,333 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-09 12:27:22,100 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 12:27:24,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 12:27:27,478 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 12:27:30,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 12:27:32,943 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 12:27:35,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 12:27:38,264 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 12:27:40,929 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 12:27:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 12:27:41,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:27:41,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:27:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 12:27:53,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 12:27:53,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:27:54,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:27:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:27:54,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:27:54,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:27:54,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 16 [2018-12-09 12:27:54,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 12:27:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 12:27:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=73, Unknown=10, NotChecked=126, Total=240 [2018-12-09 12:27:54,238 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 16 states. [2018-12-09 12:27:56,919 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-09 12:27:59,621 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:28:02,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:28:05,050 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-09 12:28:07,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:28:10,131 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-09 12:28:12,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:28:15,405 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-09 12:28:17,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 12:29:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:29:19,256 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2018-12-09 12:29:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 12:29:19,572 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-12-09 12:29:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:29:19,575 INFO L225 Difference]: With dead ends: 130 [2018-12-09 12:29:19,575 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 12:29:19,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=63, Invalid=148, Unknown=19, NotChecked=420, Total=650 [2018-12-09 12:29:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 12:29:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 47. [2018-12-09 12:29:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 12:29:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-12-09 12:29:19,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 26 [2018-12-09 12:29:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:29:19,589 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-12-09 12:29:19,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 12:29:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-12-09 12:29:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:29:19,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:29:19,590 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:29:19,590 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:29:19,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:29:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-12-09 12:29:19,591 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:29:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-09 12:29:19,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:29:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:29:25,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:29:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 12:29:25,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:29:25,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:29:25,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:29:25,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:29:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:29:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:29:25,226 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 7 states. [2018-12-09 12:29:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:29:40,302 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-12-09 12:29:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:29:40,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 12:29:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:29:40,304 INFO L225 Difference]: With dead ends: 80 [2018-12-09 12:29:40,304 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 12:29:40,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:29:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 12:29:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-09 12:29:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 12:29:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-12-09 12:29:40,319 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2018-12-09 12:29:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:29:40,320 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-09 12:29:40,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:29:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-12-09 12:29:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 12:29:40,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:29:40,321 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:29:40,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:29:40,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:29:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-12-09 12:29:40,321 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:29:40,322 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-09 12:29:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:29:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:29:45,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:29:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 12:29:45,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 12:29:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:29:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:29:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:29:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:29:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:29:45,957 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 7 states. [2018-12-09 12:29:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:29:51,209 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-12-09 12:29:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:29:51,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 12:29:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:29:51,210 INFO L225 Difference]: With dead ends: 77 [2018-12-09 12:29:51,210 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 12:29:51,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:29:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 12:29:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-09 12:29:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 12:29:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 12:29:51,219 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2018-12-09 12:29:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:29:51,219 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 12:29:51,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:29:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 12:29:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 12:29:51,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:29:51,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:29:51,220 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:29:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:29:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-12-09 12:29:51,221 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:29:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-09 12:29:51,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:29:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:29:56,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:29:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 12:29:56,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:29:58,683 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 12:30:00,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 12:30:03,181 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 12:30:05,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 12:30:07,990 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 12:30:10,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 12:30:12,804 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 12:30:15,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 12:30:25,349 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 12:30:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-12-09 12:30:25,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:30:25,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:30:25,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:30:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Forcibly destroying the process [2018-12-09 12:30:41,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:30:41,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-09 12:30:41,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 12:30:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 12:30:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2018-12-09 12:30:41,089 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-12-09 12:30:43,544 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_main_~main__d~0))) is different from true [2018-12-09 12:30:45,967 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2018-12-09 12:30:48,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-09 12:30:50,482 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-12-09 12:30:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:30:59,605 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-12-09 12:30:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:30:59,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-09 12:30:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:30:59,606 INFO L225 Difference]: With dead ends: 94 [2018-12-09 12:30:59,606 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 12:30:59,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2018-12-09 12:30:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 12:30:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-12-09 12:30:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 12:30:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-12-09 12:30:59,615 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-12-09 12:30:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:30:59,615 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-12-09 12:30:59,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 12:30:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-12-09 12:30:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 12:30:59,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:30:59,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:30:59,616 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:30:59,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:30:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-12-09 12:30:59,616 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:30:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-09 12:30:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:04,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:31:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 12:31:04,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:31:05,766 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 12:31:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 12:31:05,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:31:05,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:31:05,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:10,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:31:17,907 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 12:31:31,996 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 11 [2018-12-09 12:31:51,575 WARN L180 SmtUtils]: Spent 4.96 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 12:32:15,226 WARN L180 SmtUtils]: Spent 3.33 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 12:32:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 12:32:15,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:32:28,493 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2))) (or (fp.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2018-12-09 12:32:30,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2))) (or (fp.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2018-12-09 12:32:51,260 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 12:33:19,744 WARN L180 SmtUtils]: Spent 7.24 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 12:33:21,957 WARN L854 $PredicateComparison]: unable to prove that (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse1 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse4))) (or (fp.gt .cse0 .cse1) (not (let ((.cse3 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)))) (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-12-09 12:33:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Forcibly destroying the process [2018-12-09 12:33:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 12:33:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7, 8] total 19 [2018-12-09 12:33:22,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 12:33:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 12:33:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=218, Unknown=12, NotChecked=62, Total=342 [2018-12-09 12:33:22,166 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 19 states. [2018-12-09 12:33:44,690 WARN L180 SmtUtils]: Spent 4.89 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 12:33:53,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse7 (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse8 .cse8)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 .cse7)) (.cse4 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse7))) (or (fp.gt .cse3 .cse4) (not (let ((.cse6 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse5 .cse6) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse6)))) (fp.lt .cse3 (fp.neg .cse4)))))) (= .cse2 c_main_~SqrtR__xn~0) (let ((.cse11 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse0 .cse11)) (.cse10 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse11))) (or (fp.gt .cse9 .cse10) (fp.lt .cse9 (fp.neg .cse10))))) (= .cse2 c_main_~main__d~0))) is different from true [2018-12-09 12:33:55,203 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse5 .cse5))) (and (= (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0) c_main_~SqrtR__lsup~0) (= (fp.neg c_main_~SqrtR__lsup~0) c_main_~SqrtR__linf~0) (exists ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (let ((.cse2 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)) (.cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0) .cse3))) (and (fp.gt .cse1 .cse2) (= .cse2 c_main_~SqrtR__lsup~0) (= c_main_~SqrtR__residu~0 .cse1))))) (= .cse5 c_main_~main__d~0) (= c_main_~SqrtR__residu~0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0))))) is different from false [2018-12-09 12:34:28,741 WARN L180 SmtUtils]: Spent 5.00 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 12:34:42,537 WARN L180 SmtUtils]: Spent 3.14 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 12:35:46,835 WARN L180 SmtUtils]: Spent 9.52 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 12:36:08,451 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse1 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse4))) (or (fp.gt .cse0 .cse1) (not (let ((.cse3 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)))) (fp.lt .cse0 (fp.neg .cse1)))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__xn~0)) is different from true [2018-12-09 12:36:31,495 WARN L180 SmtUtils]: Spent 8.70 s on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-12-09 12:36:57,172 WARN L180 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 12:37:07,616 WARN L832 $PredicateComparison]: unable to prove that (and (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (or (fp.gt c_main_~SqrtR__residu~0 c_main_~SqrtR__lsup~0) (fp.lt c_main_~SqrtR__residu~0 c_main_~SqrtR__linf~0))) is different from false [2018-12-09 12:37:29,638 WARN L180 SmtUtils]: Spent 3.77 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 12:38:43,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0))) (and (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse7 (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse8 .cse8)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 .cse7)) (.cse4 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse7))) (or (fp.gt .cse3 .cse4) (not (let ((.cse6 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse5 .cse6) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse6)))) (fp.lt .cse3 (fp.neg .cse4)))))) (= .cse2 c_main_~SqrtR__xn~0) (let ((.cse11 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse0 .cse11)) (.cse10 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse11))) (or (fp.gt .cse9 .cse10) (fp.lt .cse9 (fp.neg .cse10))))))) is different from true [2018-12-09 12:38:45,054 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (and (= (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0) c_main_~SqrtR__lsup~0) (= (fp.neg c_main_~SqrtR__lsup~0) c_main_~SqrtR__linf~0) (exists ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (let ((.cse2 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)) (.cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0) .cse3))) (and (fp.gt .cse1 .cse2) (= .cse2 c_main_~SqrtR__lsup~0) (= c_main_~SqrtR__residu~0 .cse1))))) (= c_main_~SqrtR__residu~0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0)))) is different from false [2018-12-09 12:38:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:38:45,461 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2018-12-09 12:38:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 12:38:45,462 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-12-09 12:38:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:38:45,462 INFO L225 Difference]: With dead ends: 169 [2018-12-09 12:38:45,462 INFO L226 Difference]: Without dead ends: 144 [2018-12-09 12:38:45,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 265.5s TimeCoverageRelationStatistics Valid=115, Invalid=448, Unknown=21, NotChecked=408, Total=992 [2018-12-09 12:38:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-09 12:38:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 73. [2018-12-09 12:38:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 12:38:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-12-09 12:38:45,485 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 33 [2018-12-09 12:38:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:38:45,485 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-12-09 12:38:45,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 12:38:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-12-09 12:38:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:38:45,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:38:45,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:38:45,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:38:45,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:38:45,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-12-09 12:38:45,487 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 12:38:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_821172f7-7599-4033-9d6f-974c5bb67c7a/bin-2019/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-12-09 12:38:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:38:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:38:52,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:38:56,178 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 12:38:56,379 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2018-12-09 12:38:56,381 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-09 12:38:56,387 INFO L168 Benchmark]: Toolchain (without parser) took 820907.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 908.7 MB in the end (delta: 36.0 MB). Peak memory consumption was 164.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:38:56,389 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:38:56,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.43 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:38:56,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.38 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:38:56,390 INFO L168 Benchmark]: Boogie Preprocessor took 15.82 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:38:56,390 INFO L168 Benchmark]: RCFGBuilder took 8424.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:38:56,391 INFO L168 Benchmark]: TraceAbstraction took 812307.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 908.7 MB in the end (delta: 192.4 MB). Peak memory consumption was 188.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:38:56,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.43 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.38 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.82 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8424.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 812307.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 908.7 MB in the end (delta: 192.4 MB). Peak memory consumption was 188.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...