./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:49:11,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:49:11,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:49:11,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:49:11,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:49:11,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:49:11,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:49:11,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:49:11,853 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:49:11,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:49:11,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:49:11,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:49:11,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:49:11,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:49:11,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:49:11,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:49:11,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:49:11,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:49:11,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:49:11,861 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:49:11,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:49:11,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:49:11,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:49:11,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:49:11,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:49:11,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:49:11,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:49:11,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:49:11,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:49:11,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:49:11,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:49:11,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:49:11,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:49:11,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:49:11,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:49:11,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:49:11,868 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:49:11,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:49:11,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:49:11,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:49:11,876 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:49:11,876 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:49:11,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:49:11,877 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:49:11,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:49:11,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:49:11,878 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:49:11,879 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:49:11,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:49:11,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:49:11,879 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:49:11,879 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_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:11,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:49:11,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:49:11,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:49:11,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:49:11,911 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:49:11,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:11,945 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/6fb6d0435/21191e1958f944d5a7355116e868c6f8/FLAGcbdf1e2f5 [2018-11-18 12:49:12,332 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:49:12,332 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:12,336 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/6fb6d0435/21191e1958f944d5a7355116e868c6f8/FLAGcbdf1e2f5 [2018-11-18 12:49:12,344 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/6fb6d0435/21191e1958f944d5a7355116e868c6f8 [2018-11-18 12:49:12,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:49:12,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:49:12,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:49:12,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:49:12,350 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:49:12,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12, skipping insertion in model container [2018-11-18 12:49:12,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:49:12,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:49:12,488 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:49:12,492 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:49:12,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:49:12,516 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:49:12,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12 WrapperNode [2018-11-18 12:49:12,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:49:12,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:49:12,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:49:12,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:49:12,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:49:12,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:49:12,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:49:12,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:49:12,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... [2018-11-18 12:49:12,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:49:12,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:49:12,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:49:12,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:49:12,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:49:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:49:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:49:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:49:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:49:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:49:12,743 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:49:12,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:49:12 BoogieIcfgContainer [2018-11-18 12:49:12,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:49:12,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:49:12,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:49:12,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:49:12,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:49:12" (1/3) ... [2018-11-18 12:49:12,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c055def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:49:12, skipping insertion in model container [2018-11-18 12:49:12,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:12" (2/3) ... [2018-11-18 12:49:12,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c055def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:49:12, skipping insertion in model container [2018-11-18 12:49:12,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:49:12" (3/3) ... [2018-11-18 12:49:12,748 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:12,756 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:49:12,763 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:49:12,776 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:49:12,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:49:12,803 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:49:12,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:49:12,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:49:12,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:49:12,803 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:49:12,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:49:12,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:49:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 12:49:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:12,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:12,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:12,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:12,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-18 12:49:12,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:49:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:12,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:12,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:49:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:12,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:12,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:49:12,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:49:12,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:49:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:49:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:49:12,971 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-18 12:49:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:13,026 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-18 12:49:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:49:13,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 12:49:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:49:13,033 INFO L225 Difference]: With dead ends: 75 [2018-11-18 12:49:13,033 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 12:49:13,035 INFO L604 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-11-18 12:49:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 12:49:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-11-18 12:49:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 12:49:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-18 12:49:13,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-18 12:49:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:49:13,059 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-18 12:49:13,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:49:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-18 12:49:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:13,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:13,060 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:13,060 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:13,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-11-18 12:49:13,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:49:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:13,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:13,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:49:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:13,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:13,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:49:13,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:49:13,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:49:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:49:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:49:13,101 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-18 12:49:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:13,145 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-18 12:49:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:49:13,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 12:49:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:49:13,146 INFO L225 Difference]: With dead ends: 50 [2018-11-18 12:49:13,146 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 12:49:13,147 INFO L604 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-11-18 12:49:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 12:49:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-11-18 12:49:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 12:49:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 12:49:13,150 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-18 12:49:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:49:13,150 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 12:49:13,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:49:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-18 12:49:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:13,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:13,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:13,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:13,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-11-18 12:49:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:49:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:13,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:49:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:13,174 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:49:13,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:49:13 BoogieIcfgContainer [2018-11-18 12:49:13,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:49:13,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:49:13,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:49:13,192 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:49:13,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:49:12" (3/4) ... [2018-11-18 12:49:13,195 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:49:13,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:49:13,195 INFO L168 Benchmark]: Toolchain (without parser) took 848.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -113.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,196 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:49:13,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:49:13,197 INFO L168 Benchmark]: Boogie Preprocessor took 14.69 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,198 INFO L168 Benchmark]: RCFGBuilder took 198.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,198 INFO L168 Benchmark]: TraceAbstraction took 448.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,199 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:13,201 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.69 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 448.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. 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.1s 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-5842f4b [2018-11-18 12:49:14,579 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:49:14,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:49:14,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:49:14,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:49:14,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:49:14,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:49:14,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:49:14,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:49:14,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:49:14,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:49:14,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:49:14,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:49:14,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:49:14,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:49:14,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:49:14,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:49:14,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:49:14,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:49:14,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:49:14,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:49:14,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:49:14,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:49:14,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:49:14,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:49:14,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:49:14,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:49:14,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:49:14,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:49:14,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:49:14,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:49:14,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:49:14,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:49:14,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:49:14,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:49:14,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:49:14,608 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 12:49:14,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:49:14,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:49:14,619 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:49:14,619 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:49:14,619 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:49:14,619 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:49:14,620 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:49:14,620 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:49:14,620 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:49:14,620 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:49:14,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:49:14,621 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:49:14,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:49:14,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:49:14,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 12:49:14,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:49:14,624 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 12:49:14,624 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 12:49:14,624 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_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:14,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:49:14,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:49:14,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:49:14,661 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:49:14,661 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:49:14,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:14,696 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/add6588c2/4b3530a7a8394a7bbcbc04d5c7adaec4/FLAGec960208b [2018-11-18 12:49:15,082 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:49:15,083 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:15,087 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/add6588c2/4b3530a7a8394a7bbcbc04d5c7adaec4/FLAGec960208b [2018-11-18 12:49:15,095 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/bin-2019/utaipan/data/add6588c2/4b3530a7a8394a7bbcbc04d5c7adaec4 [2018-11-18 12:49:15,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:49:15,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:49:15,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:49:15,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:49:15,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:49:15,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df5c0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15, skipping insertion in model container [2018-11-18 12:49:15,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:49:15,127 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:49:15,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:49:15,258 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:49:15,275 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:49:15,284 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:49:15,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15 WrapperNode [2018-11-18 12:49:15,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:49:15,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:49:15,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:49:15,285 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:49:15,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:49:15,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:49:15,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:49:15,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:49:15,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... [2018-11-18 12:49:15,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:49:15,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:49:15,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:49:15,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:49:15,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:49:15,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:49:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:49:15,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:49:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:49:15,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:49:22,467 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:49:22,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:49:22 BoogieIcfgContainer [2018-11-18 12:49:22,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:49:22,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:49:22,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:49:22,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:49:22,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:49:15" (1/3) ... [2018-11-18 12:49:22,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196a7952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:49:22, skipping insertion in model container [2018-11-18 12:49:22,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:49:15" (2/3) ... [2018-11-18 12:49:22,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196a7952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:49:22, skipping insertion in model container [2018-11-18 12:49:22,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:49:22" (3/3) ... [2018-11-18 12:49:22,481 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 12:49:22,486 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:49:22,491 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:49:22,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:49:22,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:49:22,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:49:22,521 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:49:22,521 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:49:22,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:49:22,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:49:22,521 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:49:22,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:49:22,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:49:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 12:49:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:22,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:22,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:22,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:22,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:22,539 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-18 12:49:22,542 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:49:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:24,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:24,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:49:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:24,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:49:24,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:49:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:49:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:49:24,356 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-18 12:49:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:28,033 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-18 12:49:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:49:28,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 12:49:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:49:28,042 INFO L225 Difference]: With dead ends: 70 [2018-11-18 12:49:28,042 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 12:49:28,045 INFO L604 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-11-18 12:49:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 12:49:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-18 12:49:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 12:49:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-18 12:49:28,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-18 12:49:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:49:28,069 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-18 12:49:28,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:49:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-18 12:49:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:28,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:28,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:28,070 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:28,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-11-18 12:49:28,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:49:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:28,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:29,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:29,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:49:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:49:29,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:49:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:49:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:49:29,230 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-18 12:49:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:35,103 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-18 12:49:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:49:35,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 12:49:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:49:35,104 INFO L225 Difference]: With dead ends: 48 [2018-11-18 12:49:35,104 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 12:49:35,105 INFO L604 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-11-18 12:49:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 12:49:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 12:49:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 12:49:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 12:49:35,108 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-18 12:49:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:49:35,108 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 12:49:35,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:49:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-18 12:49:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:49:35,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:35,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:35,109 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:35,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-11-18 12:49:35,110 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:49:35,110 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:36,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:36,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:49:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:49:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:49:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:49:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:49:36,296 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-18 12:49:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:53,601 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-18 12:49:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:49:53,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 12:49:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:49:53,603 INFO L225 Difference]: With dead ends: 55 [2018-11-18 12:49:53,603 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 12:49:53,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:49:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 12:49:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-18 12:49:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 12:49:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 12:49:53,607 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-11-18 12:49:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:49:53,608 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 12:49:53,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:49:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-18 12:49:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:49:53,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:49:53,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:53,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:49:53,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-11-18 12:49:53,609 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:49:53,609 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:49:53,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:56,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:49:56,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:49:56,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:49:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:49:56,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:49:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:49:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:49:56,908 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-11-18 12:50:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:50:02,390 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-11-18 12:50:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:50:02,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 12:50:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:50:02,391 INFO L225 Difference]: With dead ends: 54 [2018-11-18 12:50:02,391 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 12:50:02,392 INFO L604 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-11-18 12:50:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 12:50:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-11-18 12:50:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 12:50:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-18 12:50:02,396 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-11-18 12:50:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:50:02,396 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-18 12:50:02,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:50:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-18 12:50:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:50:02,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:50:02,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:02,397 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:50:02,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-11-18 12:50:02,398 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:50:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:50:02,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:50:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:05,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:50:05,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:50:08,045 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-11-18 12:50:11,435 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-11-18 12:50:13,925 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-11-18 12:50:16,324 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-11-18 12:50:18,748 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-11-18 12:50:21,163 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-11-18 12:50:23,557 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-11-18 12:50:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-18 12:50:23,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:50:23,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:50:23,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:50:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 12:50:37,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:50:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 12:50:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:50:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:50:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-11-18 12:50:37,116 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-11-18 12:50:39,525 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-11-18 12:50:41,945 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-11-18 12:50:44,455 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-11-18 12:51:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:51:17,324 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-11-18 12:51:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:51:17,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-18 12:51:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:51:17,627 INFO L225 Difference]: With dead ends: 101 [2018-11-18 12:51:17,627 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 12:51:17,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-11-18 12:51:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 12:51:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-11-18 12:51:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 12:51:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-18 12:51:17,635 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-11-18 12:51:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:51:17,635 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-18 12:51:17,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:51:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-18 12:51:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 12:51:17,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:51:17,636 INFO L375 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-11-18 12:51:17,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:51:17,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-11-18 12:51:17,637 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:51:17,637 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:51:17,641 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 12:51:22,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:51:22,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:51:23,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:25,184 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-11-18 12:51:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 12:51:25,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:51:27,569 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-11-18 12:51:31,116 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-11-18 12:51:33,642 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-11-18 12:51:36,391 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-11-18 12:51:39,154 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-11-18 12:51:41,754 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-11-18 12:51:44,358 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-11-18 12:51:46,960 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-11-18 12:51:49,562 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-11-18 12:51:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-18 12:51:49,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:51:49,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:51:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:52:02,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:52:02,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:52:02,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:52:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:02,728 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:52:02,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:52:02,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 16 [2018-11-18 12:52:02,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:52:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:52:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=73, Unknown=10, NotChecked=126, Total=240 [2018-11-18 12:52:02,809 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 16 states. [2018-11-18 12:52:05,439 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-11-18 12:52:08,066 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-11-18 12:52:10,881 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-11-18 12:52:13,362 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-11-18 12:52:16,074 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-11-18 12:52:18,528 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-11-18 12:52:21,044 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-11-18 12:52:23,537 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-11-18 12:52:26,203 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-11-18 12:53:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:53:18,320 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2018-11-18 12:53:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:53:18,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-18 12:53:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:53:18,600 INFO L225 Difference]: With dead ends: 130 [2018-11-18 12:53:18,600 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 12:53:18,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=63, Invalid=148, Unknown=19, NotChecked=420, Total=650 [2018-11-18 12:53:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 12:53:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 47. [2018-11-18 12:53:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 12:53:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-18 12:53:18,611 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 26 [2018-11-18 12:53:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:53:18,611 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-18 12:53:18,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:53:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-18 12:53:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 12:53:18,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:53:18,612 INFO L375 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-11-18 12:53:18,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:53:18,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-11-18 12:53:18,613 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:53:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:53:18,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:23,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:53:24,054 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:53:24,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:53:24,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:53:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:53:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:53:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:53:24,112 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 7 states. [2018-11-18 12:53:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:53:43,619 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-18 12:53:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:53:43,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 12:53:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:53:43,620 INFO L225 Difference]: With dead ends: 80 [2018-11-18 12:53:43,620 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 12:53:43,621 INFO L604 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-11-18 12:53:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 12:53:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-18 12:53:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 12:53:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-18 12:53:43,634 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2018-11-18 12:53:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:53:43,635 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 12:53:43,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:53:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-18 12:53:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:53:43,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:53:43,635 INFO L375 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-11-18 12:53:43,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:53:43,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-11-18 12:53:43,639 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:53:43,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:53:43,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:49,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:53:49,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:53:49,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:53:49,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:53:49,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:53:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:53:49,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:53:49,166 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 7 states. [2018-11-18 12:53:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:53:57,319 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-11-18 12:53:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:53:57,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 12:53:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:53:57,320 INFO L225 Difference]: With dead ends: 77 [2018-11-18 12:53:57,320 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 12:53:57,321 INFO L604 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-11-18 12:53:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 12:53:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-18 12:53:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 12:53:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-18 12:53:57,331 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2018-11-18 12:53:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:53:57,331 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 12:53:57,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:53:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 12:53:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 12:53:57,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:53:57,332 INFO L375 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-11-18 12:53:57,333 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:53:57,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-11-18 12:53:57,333 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:53:57,333 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:53:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:54:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:54:02,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:54:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:54:02,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:54:04,616 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-11-18 12:54:06,690 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-11-18 12:54:09,070 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-11-18 12:54:11,450 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-11-18 12:54:13,829 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-11-18 12:54:16,205 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-11-18 12:54:18,592 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-11-18 12:54:20,974 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-11-18 12:54:36,393 WARN L180 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 12:54:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-11-18 12:54:36,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:54:36,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:54:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:54:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Forcibly destroying the process [2018-11-18 12:54:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:54:52,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 12:54:52,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:54:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:54:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=61, Unknown=10, NotChecked=76, Total=182 [2018-11-18 12:54:52,605 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-11-18 12:54:55,047 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-11-18 12:54:57,445 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-11-18 12:54:59,848 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-11-18 12:55:01,925 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-11-18 12:55:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:55:34,613 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-18 12:55:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:55:34,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-18 12:55:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:55:34,615 INFO L225 Difference]: With dead ends: 94 [2018-11-18 12:55:34,615 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 12:55:34,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=43, Invalid=65, Unknown=14, NotChecked=184, Total=306 [2018-11-18 12:55:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 12:55:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-11-18 12:55:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 12:55:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-18 12:55:34,625 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-11-18 12:55:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:55:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-18 12:55:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:55:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-18 12:55:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 12:55:34,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:55:34,626 INFO L375 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-11-18 12:55:34,627 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:55:34,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:55:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-11-18 12:55:34,627 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 12:55:34,627 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:55:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:55:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:55:39,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:55:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:55:39,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:55:41,037 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-18 12:55:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:55:41,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:55:41,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd3b19d-a3d2-469b-a1ae-225ee157e1fc/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-11-18 12:55:41,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:55:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:55:45,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:55:54,908 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 12:56:10,381 WARN L180 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-18 12:56:26,338 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 12:56:46,166 WARN L180 SmtUtils]: Spent 3.16 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 12:56:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:56:46,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:56:59,794 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-11-18 12:57:01,869 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-11-18 12:57:26,199 WARN L180 SmtUtils]: Spent 5.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 12:57:52,081 WARN L180 SmtUtils]: Spent 5.43 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 12:57:54,387 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-11-18 12:57:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2018-11-18 12:57:54,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 12:57:54,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7, 8] total 19 [2018-11-18 12:57:54,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 12:57:54,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:57:54,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=219, Unknown=11, NotChecked=62, Total=342 [2018-11-18 12:57:54,593 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 19 states. [2018-11-18 12:58:18,447 WARN L180 SmtUtils]: Spent 5.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 12:58:23,486 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-11-18 12:58:25,524 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-11-18 12:58:49,480 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (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_main_~main__d~0 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from false [2018-11-18 12:58:52,527 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (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 .cse1 .cse2) c_main_~SqrtR__Input~0) (not (fp.leq (fp.add roundNearestTiesToEven c_main_~main__d~0 .cse2) .cse1)))) is different from false [2018-11-18 12:58:54,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (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 .cse1 .cse2) c_main_~SqrtR__Input~0) (not (fp.leq (fp.add roundNearestTiesToEven c_main_~main__d~0 .cse2) .cse1)))) is different from true [2018-11-18 12:59:46,187 WARN L180 SmtUtils]: Spent 10.31 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 13:00:24,496 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 13:00:24,497 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPrecondition(IncrementalHoareTripleChecker.java:334) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:258) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:688) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-11-18 13:00:24,499 INFO L168 Benchmark]: Toolchain (without parser) took 669402.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 948.7 MB in the beginning and 962.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:00:24,499 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:00:24,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:00:24,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.85 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:00:24,500 INFO L168 Benchmark]: Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:00:24,501 INFO L168 Benchmark]: RCFGBuilder took 7149.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:00:24,501 INFO L168 Benchmark]: TraceAbstraction took 662030.41 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -4.7 MB). Free memory was 1.1 GB in the beginning and 962.7 MB in the end (delta: 122.2 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:00:24,503 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.85 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 7149.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 662030.41 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -4.7 MB). Free memory was 1.1 GB in the beginning and 962.7 MB in the end (delta: 122.2 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...