./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/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_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/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_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/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_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:02:03,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:02:03,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:02:03,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:02:03,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:02:03,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:02:03,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:02:03,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:02:03,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:02:03,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:02:03,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:02:03,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:02:03,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:02:03,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:02:03,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:02:03,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:02:03,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:02:03,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:02:03,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:02:03,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:02:03,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:02:03,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:02:03,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:02:03,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:02:03,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:02:03,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:02:03,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:02:03,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:02:03,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:02:03,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:02:03,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:02:03,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:02:03,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:02:03,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:02:03,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:02:03,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:02:03,830 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 08:02:03,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:02:03,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:02:03,838 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:02:03,838 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:02:03,838 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:02:03,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:02:03,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:02:03,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:02:03,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:02:03,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:02:03,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:02:03,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:02:03,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:02:03,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:02:03,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 08:02:03,841 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_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-02 08:02:03,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:02:03,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:02:03,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:02:03,867 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:02:03,867 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:02:03,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:03,902 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/814fc9fe7/eee200a59c8f470a83be61d8f74e9477/FLAG46c1cf88e [2018-12-02 08:02:04,328 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:02:04,329 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:04,333 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/814fc9fe7/eee200a59c8f470a83be61d8f74e9477/FLAG46c1cf88e [2018-12-02 08:02:04,341 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/814fc9fe7/eee200a59c8f470a83be61d8f74e9477 [2018-12-02 08:02:04,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:02:04,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:02:04,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:02:04,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:02:04,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:02:04,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432dabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04, skipping insertion in model container [2018-12-02 08:02:04,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:02:04,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:02:04,456 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:02:04,459 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:02:04,473 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:02:04,481 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:02:04,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04 WrapperNode [2018-12-02 08:02:04,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:02:04,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:02:04,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:02:04,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:02:04,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:02:04,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:02:04,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:02:04,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:02:04,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... [2018-12-02 08:02:04,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:02:04,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:02:04,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:02:04,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:02:04,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:02:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:02:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:02:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:02:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:02:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:02:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:02:04,675 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:02:04,676 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 08:02:04,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:02:04 BoogieIcfgContainer [2018-12-02 08:02:04,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:02:04,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:02:04,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:02:04,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:02:04,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:02:04" (1/3) ... [2018-12-02 08:02:04,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77479949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:02:04, skipping insertion in model container [2018-12-02 08:02:04,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:04" (2/3) ... [2018-12-02 08:02:04,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77479949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:02:04, skipping insertion in model container [2018-12-02 08:02:04,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:02:04" (3/3) ... [2018-12-02 08:02:04,680 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:04,686 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:02:04,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 08:02:04,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 08:02:04,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:02:04,717 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:02:04,717 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:02:04,717 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:02:04,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:02:04,717 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:02:04,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:02:04,717 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:02:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-02 08:02:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:04,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:04,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:04,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:04,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-02 08:02:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:02:04,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:04,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:02:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:04,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:04,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:02:04,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:02:04,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:02:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:02:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:02:04,839 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-02 08:02:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:04,881 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-12-02 08:02:04,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:02:04,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 08:02:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:04,887 INFO L225 Difference]: With dead ends: 75 [2018-12-02 08:02:04,887 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 08:02:04,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 08:02:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-12-02 08:02:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 08:02:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-02 08:02:04,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-02 08:02:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:04,911 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 08:02:04,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:02:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-02 08:02:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:04,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:04,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:04,912 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:04,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-12-02 08:02:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:02:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:02:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:04,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:04,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:02:04,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:02:04,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:02:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:02:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:02:04,945 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-02 08:02:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:04,976 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-12-02 08:02:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:02:04,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 08:02:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:04,977 INFO L225 Difference]: With dead ends: 50 [2018-12-02 08:02:04,977 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 08:02:04,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 08:02:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-12-02 08:02:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 08:02:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-02 08:02:04,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-02 08:02:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:04,981 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-02 08:02:04,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:02:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-02 08:02:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:04,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:04,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:04,981 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:04,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-12-02 08:02:04,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:02:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:02:04,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:02:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:02:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:02:05,005 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:02:05,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:02:05 BoogieIcfgContainer [2018-12-02 08:02:05,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:02:05,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:02:05,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:02:05,023 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:02:05,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:02:04" (3/4) ... [2018-12-02 08:02:05,025 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:02:05,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:02:05,026 INFO L168 Benchmark]: Toolchain (without parser) took 681.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -98.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,026 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:02:05,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.56 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,027 INFO L168 Benchmark]: Boogie Preprocessor took 40.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,028 INFO L168 Benchmark]: RCFGBuilder took 141.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,028 INFO L168 Benchmark]: TraceAbstraction took 345.68 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:02:05,028 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:02:05,030 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.56 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 345.68 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:02:06,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:02:06,304 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:02:06,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:02:06,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:02:06,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:02:06,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:02:06,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:02:06,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:02:06,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:02:06,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:02:06,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:02:06,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:02:06,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:02:06,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:02:06,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:02:06,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:02:06,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:02:06,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:02:06,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:02:06,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:02:06,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:02:06,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:02:06,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:02:06,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:02:06,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:02:06,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:02:06,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:02:06,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:02:06,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:02:06,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:02:06,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:02:06,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:02:06,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:02:06,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:02:06,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:02:06,332 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 08:02:06,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:02:06,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:02:06,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:02:06,343 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:02:06,343 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:02:06,343 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:02:06,343 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:02:06,343 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:02:06,344 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:02:06,344 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:02:06,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:02:06,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:02:06,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:02:06,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:02:06,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:02:06,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:02:06,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 08:02:06,346 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 08:02:06,347 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_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-02 08:02:06,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:02:06,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:02:06,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:02:06,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:02:06,379 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:02:06,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:06,415 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/08e7b623f/02bd6fed638e46aaa1493c7a5dafc305/FLAG723945118 [2018-12-02 08:02:06,817 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:02:06,818 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:06,822 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/08e7b623f/02bd6fed638e46aaa1493c7a5dafc305/FLAG723945118 [2018-12-02 08:02:06,830 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/data/08e7b623f/02bd6fed638e46aaa1493c7a5dafc305 [2018-12-02 08:02:06,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:02:06,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:02:06,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:02:06,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:02:06,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:02:06,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:02:06" (1/1) ... [2018-12-02 08:02:06,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4428e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:06, skipping insertion in model container [2018-12-02 08:02:06,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:02:06" (1/1) ... [2018-12-02 08:02:06,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:02:06,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:02:06,971 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:02:06,977 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:02:06,996 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:02:07,007 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:02:07,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07 WrapperNode [2018-12-02 08:02:07,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:02:07,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:02:07,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:02:07,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:02:07,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:02:07,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:02:07,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:02:07,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:02:07,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... [2018-12-02 08:02:07,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:02:07,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:02:07,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:02:07,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:02:07,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:02:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:02:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:02:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:02:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:02:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:02:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:02:14,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:02:14,101 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 08:02:14,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:02:14 BoogieIcfgContainer [2018-12-02 08:02:14,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:02:14,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:02:14,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:02:14,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:02:14,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:02:06" (1/3) ... [2018-12-02 08:02:14,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381a8a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:02:14, skipping insertion in model container [2018-12-02 08:02:14,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:02:07" (2/3) ... [2018-12-02 08:02:14,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381a8a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:02:14, skipping insertion in model container [2018-12-02 08:02:14,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:02:14" (3/3) ... [2018-12-02 08:02:14,108 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-02 08:02:14,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:02:14,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 08:02:14,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 08:02:14,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:02:14,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:02:14,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:02:14,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:02:14,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:02:14,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:02:14,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:02:14,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:02:14,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:02:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-02 08:02:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:14,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:14,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:14,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:14,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-02 08:02:14,167 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:02:14,168 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-02 08:02:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:15,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:02:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:15,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:02:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:15,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:02:15,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:02:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:02:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:02:15,998 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-02 08:02:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:20,192 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-12-02 08:02:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:02:20,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 08:02:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:20,200 INFO L225 Difference]: With dead ends: 70 [2018-12-02 08:02:20,200 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 08:02:20,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 08:02:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-12-02 08:02:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 08:02:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-02 08:02:20,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-02 08:02:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:20,224 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 08:02:20,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:02:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-02 08:02:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:20,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:20,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:20,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:20,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-12-02 08:02:20,225 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:02:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-02 08:02:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:21,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:02:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:21,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:02:21,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:02:21,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:02:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:02:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:02:21,384 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-02 08:02:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:28,969 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-12-02 08:02:28,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:02:28,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 08:02:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:28,970 INFO L225 Difference]: With dead ends: 48 [2018-12-02 08:02:28,970 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 08:02:28,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 08:02:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 08:02:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 08:02:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-02 08:02:28,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-02 08:02:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:28,975 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-02 08:02:28,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:02:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-02 08:02:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 08:02:28,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:28,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:28,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:28,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-12-02 08:02:28,976 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:02:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-02 08:02:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:30,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:02:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:30,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:02:30,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:30,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:02:30,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:02:30,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:02:30,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:30,162 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-12-02 08:02:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:47,330 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-12-02 08:02:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:02:47,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 08:02:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:47,332 INFO L225 Difference]: With dead ends: 55 [2018-12-02 08:02:47,332 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 08:02:47,332 INFO L631 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-12-02 08:02:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 08:02:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-02 08:02:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 08:02:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-02 08:02:47,336 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-12-02 08:02:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:47,336 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-02 08:02:47,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:02:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-02 08:02:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:02:47,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:47,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:47,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:47,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-12-02 08:02:47,338 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:02:47,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-02 08:02:47,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:50,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:02:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:02:50,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:02:50,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:02:50,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:02:50,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:02:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:02:50,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:02:50,666 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-12-02 08:02:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:02:52,869 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-12-02 08:02:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:02:52,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 08:02:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:02:52,870 INFO L225 Difference]: With dead ends: 54 [2018-12-02 08:02:52,870 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 08:02:52,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:02:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 08:02:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-12-02 08:02:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 08:02:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-02 08:02:52,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-12-02 08:02:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:02:52,875 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-02 08:02:52,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:02:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-02 08:02:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:02:52,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:02:52,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:02:52,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:02:52,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:02:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-12-02 08:02:52,876 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:02:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-02 08:02:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:02:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:02:56,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:02:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:02:56,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:02:58,518 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-02 08:03:00,812 WARN L854 $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 true [2018-12-02 08:03:03,343 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-02 08:03:05,848 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-02 08:03:08,261 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-02 08:03:10,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-02 08:03:13,063 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-02 08:03:15,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-02 08:03:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-02 08:03:15,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:03:15,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:03:15,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:03:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-02 08:03:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:03:29,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-02 08:03:29,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 08:03:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 08:03:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=41, Unknown=8, NotChecked=60, Total=132 [2018-12-02 08:03:29,088 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-12-02 08:03:31,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-02 08:03:33,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:03:36,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:04:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:04:04,712 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-12-02 08:04:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:04:05,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-02 08:04:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:04:05,014 INFO L225 Difference]: With dead ends: 101 [2018-12-02 08:04:05,014 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 08:04:05,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=34, Invalid=55, Unknown=11, NotChecked=140, Total=240 [2018-12-02 08:04:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 08:04:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-12-02 08:04:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 08:04:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-12-02 08:04:05,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-12-02 08:04:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:04:05,023 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-12-02 08:04:05,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 08:04:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-12-02 08:04:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:04:05,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:04:05,024 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:04:05,025 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:04:05,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:04:05,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-12-02 08:04:05,025 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:04:05,025 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-02 08:04:05,029 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 08:04:10,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 08:04:10,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:04:10,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:04:12,593 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:04:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-02 08:04:12,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:04:14,970 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-02 08:04:18,330 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-02 08:04:20,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-02 08:04:23,646 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-02 08:04:26,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-02 08:04:29,074 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-02 08:04:31,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-02 08:04:34,327 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-02 08:04:36,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-02 08:04:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 08:04:37,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:04:37,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:04:37,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 08:04:49,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 08:04:49,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:04:50,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:04:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:04:50,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:04:50,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:04:50,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 16 [2018-12-02 08:04:50,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 08:04:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 08:04:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=73, Unknown=10, NotChecked=126, Total=240 [2018-12-02 08:04:50,243 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 16 states. [2018-12-02 08:04:52,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-02 08:04:55,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:04:58,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:05:00,898 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-02 08:05:03,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:05:05,959 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-02 08:05:08,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:05:11,005 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-02 08:05:13,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-02 08:06:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:06:14,172 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2018-12-02 08:06:14,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:06:14,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-12-02 08:06:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:06:14,469 INFO L225 Difference]: With dead ends: 130 [2018-12-02 08:06:14,469 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 08:06:14,470 INFO L631 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-12-02 08:06:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 08:06:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 47. [2018-12-02 08:06:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 08:06:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-12-02 08:06:14,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 26 [2018-12-02 08:06:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:06:14,485 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-12-02 08:06:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 08:06:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-12-02 08:06:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:06:14,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:06:14,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:06:14,486 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:06:14,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:06:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-12-02 08:06:14,487 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:06:14,487 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-02 08:06:14,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:06:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:06:19,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:06:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 08:06:19,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:06:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:06:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:06:20,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:06:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:06:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:06:20,044 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 7 states. [2018-12-02 08:06:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:06:40,312 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-12-02 08:06:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:06:40,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 08:06:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:06:40,314 INFO L225 Difference]: With dead ends: 80 [2018-12-02 08:06:40,314 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 08:06:40,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:06:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 08:06:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-02 08:06:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 08:06:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-12-02 08:06:40,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2018-12-02 08:06:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:06:40,323 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-02 08:06:40,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:06:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-12-02 08:06:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:06:40,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:06:40,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:06:40,323 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:06:40,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:06:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-12-02 08:06:40,324 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:06:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-02 08:06:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:06:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:06:45,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:06:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 08:06:45,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:06:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:06:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:06:45,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:06:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:06:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:06:45,908 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 7 states. [2018-12-02 08:06:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:06:52,166 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-12-02 08:06:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:06:52,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 08:06:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:06:52,168 INFO L225 Difference]: With dead ends: 77 [2018-12-02 08:06:52,168 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 08:06:52,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:06:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 08:06:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-02 08:06:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:06:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-02 08:06:52,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2018-12-02 08:06:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:06:52,179 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-02 08:06:52,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:06:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-02 08:06:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:06:52,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:06:52,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:06:52,180 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:06:52,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:06:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-12-02 08:06:52,180 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:06:52,180 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-02 08:06:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:06:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:06:57,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:06:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:06:57,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:06:59,554 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-02 08:07:01,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-02 08:07:04,032 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-02 08:07:06,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-02 08:07:08,853 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-02 08:07:11,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-02 08:07:13,681 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-02 08:07:16,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-02 08:07:22,133 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 08:07:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-12-02 08:07:22,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:07:22,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:07:22,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Forcibly destroying the process [2018-12-02 08:07:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:07:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-02 08:07:38,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 08:07:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 08:07:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2018-12-02 08:07:38,476 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-12-02 08:07:40,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_main_~main__d~0))) is different from true [2018-12-02 08:07:43,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2018-12-02 08:07:45,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-02 08:07:47,825 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-12-02 08:08:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:08:27,927 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-12-02 08:08:27,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:08:27,928 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-02 08:08:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:08:27,929 INFO L225 Difference]: With dead ends: 94 [2018-12-02 08:08:27,929 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 08:08:27,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2018-12-02 08:08:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 08:08:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-12-02 08:08:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 08:08:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-12-02 08:08:27,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-12-02 08:08:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:08:27,940 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-12-02 08:08:27,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 08:08:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-12-02 08:08:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:08:27,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:08:27,941 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:08:27,941 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:08:27,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-12-02 08:08:27,942 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:08:27,942 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-02 08:08:27,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:32,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:08:32,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:08:33,581 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 08:08:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:08:33,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:33,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:08:33,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:37,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:44,222 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 08:08:56,905 WARN L180 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 08:09:15,895 WARN L180 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 08:09:17,924 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.neg c_main_~SqrtR__lsup~0) c_main_~SqrtR__linf~0) (exists ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (let ((.cse1 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse2)) (.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0) .cse2))) (and (fp.gt .cse0 .cse1) (= .cse1 c_main_~SqrtR__lsup~0) (= c_main_~SqrtR__residu~0 .cse0)))))) is different from false [2018-12-02 08:09:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2018-12-02 08:09:18,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:09:29,844 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2))) (or (fp.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2018-12-02 08:09:31,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2))) (or (fp.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2018-12-02 08:09:52,531 WARN L180 SmtUtils]: Spent 2.71 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 08:10:14,980 WARN L180 SmtUtils]: Spent 5.87 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 08:10:17,175 WARN L854 $PredicateComparison]: unable to prove that (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse1 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse4))) (or (fp.gt .cse0 .cse1) (not (let ((.cse3 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)))) (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-12-02 08:10:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Forcibly destroying the process [2018-12-02 08:10:17,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 08:10:17,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7, 8] total 19 [2018-12-02 08:10:17,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 08:10:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 08:10:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=9, NotChecked=90, Total=342 [2018-12-02 08:10:17,381 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 19 states. [2018-12-02 08:10:35,734 WARN L180 SmtUtils]: Spent 4.96 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 08:10:42,084 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse7 (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse8 .cse8)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 .cse7)) (.cse4 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse7))) (or (fp.gt .cse3 .cse4) (not (let ((.cse6 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse5 .cse6) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse6)))) (fp.lt .cse3 (fp.neg .cse4)))))) (= .cse2 c_main_~SqrtR__xn~0) (let ((.cse11 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse0 .cse11)) (.cse10 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse11))) (or (fp.gt .cse9 .cse10) (fp.lt .cse9 (fp.neg .cse10))))) (= .cse2 c_main_~main__d~0))) is different from true [2018-12-02 08:10:44,126 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) (or (fp.gt c_main_~SqrtR__residu~0 c_main_~SqrtR__lsup~0) (fp.lt c_main_~SqrtR__residu~0 c_main_~SqrtR__linf~0)) (= c_main_~SqrtR__residu~0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0))))) is different from false [2018-12-02 08:11:08,496 WARN L180 SmtUtils]: Spent 6.58 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 08:11:21,397 WARN L180 SmtUtils]: Spent 5.68 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-02 08:12:08,820 WARN L180 SmtUtils]: Spent 10.15 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 08:12:23,417 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse1 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse4))) (or (fp.gt .cse0 .cse1) (not (let ((.cse3 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse3)))) (fp.lt .cse0 (fp.neg .cse1)))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__xn~0)) is different from true [2018-12-02 08:12:29,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2)) (.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2))) (and (fp.gt .cse0 .cse1) (= .cse1 c_main_~SqrtR__lsup~0) (or (fp.gt c_main_~SqrtR__residu~0 c_main_~SqrtR__lsup~0) (fp.lt c_main_~SqrtR__residu~0 c_main_~SqrtR__linf~0)) (= c_main_~SqrtR__residu~0 .cse0)))) is different from true [2018-12-02 08:12:46,595 WARN L180 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 08:13:12,476 WARN L180 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 08:13:58,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0))) (and (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((~_EPS~0 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ~_EPS~0)) (.cse7 (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse8 .cse8)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 .cse7)) (.cse4 (fp.mul roundNearestTiesToEven ~_EPS~0 .cse7))) (or (fp.gt .cse3 .cse4) (not (let ((.cse6 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven .cse5 .cse6) (fp.mul roundNearestTiesToEven ~_EPS~0 .cse6)))) (fp.lt .cse3 (fp.neg .cse4)))))) (= .cse2 c_main_~SqrtR__xn~0) (let ((.cse11 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse0 .cse11)) (.cse10 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse11))) (or (fp.gt .cse9 .cse10) (fp.lt .cse9 (fp.neg .cse10))))))) is different from true [2018-12-02 08:14:46,347 WARN L180 SmtUtils]: Spent 19.14 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-02 08:14:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:52,480 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2018-12-02 08:14:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 08:14:52,528 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-12-02 08:14:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:52,529 INFO L225 Difference]: With dead ends: 152 [2018-12-02 08:14:52,529 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 08:14:52,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 245.4s TimeCoverageRelationStatistics Valid=112, Invalid=399, Unknown=27, NotChecked=392, Total=930 [2018-12-02 08:14:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 08:14:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 73. [2018-12-02 08:14:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 08:14:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-12-02 08:14:52,551 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 33 [2018-12-02 08:14:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:52,551 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-12-02 08:14:52,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 08:14:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-12-02 08:14:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 08:14:52,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:52,552 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:52,552 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:14:52,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-12-02 08:14:52,552 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 08:14:52,552 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f3e19cb-e00f-40e7-a3f5-7f3cfb5142f2/bin-2019/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-12-02 08:14:52,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:59,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:01,502 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 08:15:01,703 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2018-12-02 08:15:01,704 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-02 08:15:01,708 INFO L168 Benchmark]: Toolchain (without parser) took 774876.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.7 MB in the beginning and 950.9 MB in the end (delta: -6.2 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:01,709 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:15:01,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.96 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:01,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:01,710 INFO L168 Benchmark]: Boogie Preprocessor took 21.22 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:15:01,711 INFO L168 Benchmark]: RCFGBuilder took 7056.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:01,711 INFO L168 Benchmark]: TraceAbstraction took 767604.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 170.6 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:01,713 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.96 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.22 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 7056.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 767604.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 170.6 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...