./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ..................................................................................................................................................................................................................................................................................................... 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_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 10:19:38,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:19:38,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:19:38,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:19:38,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:19:38,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:19:38,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:19:38,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:19:38,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:19:38,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:19:38,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:19:38,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:19:38,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:19:38,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:19:38,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:19:38,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:19:38,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:19:38,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:19:38,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:19:38,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:19:38,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:19:38,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:19:38,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:19:38,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:19:38,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:19:38,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:19:38,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:19:38,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:19:38,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:19:38,854 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:19:38,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:19:38,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:19:38,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:19:38,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:19:38,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:19:38,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:19:38,855 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:19:38,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:19:38,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:19:38,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:19:38,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:19:38,866 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:19:38,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:19:38,866 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:19:38,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:19:38,867 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:19:38,868 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:19:38,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:19:38,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:19:38,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:19:38,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:19:38,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:19:38,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:19:38,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:19:38,869 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_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-10 10:19:38,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:19:38,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:19:38,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:19:38,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:19:38,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:19:38,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:38,950 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/0a429e790/9a77edfe4b40440398f7dbd09eaec2c6/FLAG4c7c2e7c1 [2018-11-10 10:19:39,254 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:19:39,254 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:39,259 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/0a429e790/9a77edfe4b40440398f7dbd09eaec2c6/FLAG4c7c2e7c1 [2018-11-10 10:19:39,271 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/0a429e790/9a77edfe4b40440398f7dbd09eaec2c6 [2018-11-10 10:19:39,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:19:39,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:19:39,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:19:39,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:19:39,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:19:39,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39, skipping insertion in model container [2018-11-10 10:19:39,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:19:39,310 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:19:39,437 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:19:39,439 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:19:39,450 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:19:39,458 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:19:39,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39 WrapperNode [2018-11-10 10:19:39,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:19:39,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:19:39,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:19:39,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:19:39,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... [2018-11-10 10:19:39,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:19:39,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:19:39,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:19:39,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:19:39,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:19:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:19:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:19:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 10:19:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-10 10:19:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:19:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:19:39,663 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:19:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:39 BoogieIcfgContainer [2018-11-10 10:19:39,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:19:39,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:19:39,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:19:39,667 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:19:39,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:19:39" (1/3) ... [2018-11-10 10:19:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176d574f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:19:39, skipping insertion in model container [2018-11-10 10:19:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:39" (2/3) ... [2018-11-10 10:19:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176d574f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:19:39, skipping insertion in model container [2018-11-10 10:19:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:39" (3/3) ... [2018-11-10 10:19:39,669 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:39,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:19:39,679 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:19:39,687 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:19:39,709 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:19:39,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:19:39,710 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:19:39,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:19:39,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:19:39,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:19:39,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:19:39,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:19:39,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:19:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 10:19:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:19:39,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:19:39,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:19:39,732 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:19:39,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:19:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-10 10:19:39,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:19:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:19:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:19:39,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:19:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:19:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:39,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:19:39,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:19:39,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:19:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:19:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:19:39,829 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-10 10:19:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:19:39,841 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-10 10:19:39,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:19:39,842 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 10:19:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:19:39,847 INFO L225 Difference]: With dead ends: 56 [2018-11-10 10:19:39,847 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 10:19:39,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:19:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 10:19:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 10:19:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:19:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-10 10:19:39,876 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-10 10:19:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:19:39,876 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 10:19:39,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:19:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-10 10:19:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:19:39,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:19:39,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:19:39,878 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:19:39,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:19:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-10 10:19:39,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:19:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:19:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:19:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:19:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:19:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:19:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:19:39,913 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:19:39,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:19:39 BoogieIcfgContainer [2018-11-10 10:19:39,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:19:39,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:19:39,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:19:39,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:19:39,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:39" (3/4) ... [2018-11-10 10:19:39,933 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:19:39,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:19:39,934 INFO L168 Benchmark]: Toolchain (without parser) took 659.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:19:39,935 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:19:39,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:19:39,935 INFO L168 Benchmark]: Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:19:39,936 INFO L168 Benchmark]: RCFGBuilder took 186.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -223.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:19:39,936 INFO L168 Benchmark]: TraceAbstraction took 265.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:19:39,937 INFO L168 Benchmark]: Witness Printer took 2.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:19:39,939 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -223.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 265.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.97 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: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000, d=1] [L46] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L48] CALL, EXPR SqrtR(d) VAL [\old(Input)=1, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L39] RET return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] EXPR SqrtR(d) VAL [_EPS=1/1000000, d=1, SqrtR(d)=3] [L48] r = SqrtR(d) [L50] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:19:41,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:19:41,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:19:41,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:19:41,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:19:41,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:19:41,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:19:41,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:19:41,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:19:41,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:19:41,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:19:41,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:19:41,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:19:41,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:19:41,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:19:41,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:19:41,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:19:41,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:19:41,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:19:41,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:19:41,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:19:41,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:19:41,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:19:41,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:19:41,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:19:41,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:19:41,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:19:41,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:19:41,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:19:41,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:19:41,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:19:41,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:19:41,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:19:41,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:19:41,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:19:41,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:19:41,352 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 10:19:41,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:19:41,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:19:41,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:19:41,362 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:19:41,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:19:41,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:19:41,363 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:19:41,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:19:41,364 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:19:41,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:19:41,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:19:41,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:19:41,366 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:19:41,367 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:19:41,367 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_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-10 10:19:41,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:19:41,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:19:41,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:19:41,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:19:41,411 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:19:41,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:41,457 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/a4d6309af/ac8e3d36b7684b7aa583104a4166d265/FLAG51a8b5d54 [2018-11-10 10:19:41,852 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:19:41,852 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:41,856 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/a4d6309af/ac8e3d36b7684b7aa583104a4166d265/FLAG51a8b5d54 [2018-11-10 10:19:41,866 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/data/a4d6309af/ac8e3d36b7684b7aa583104a4166d265 [2018-11-10 10:19:41,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:19:41,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:19:41,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:19:41,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:19:41,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:19:41,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:19:41" (1/1) ... [2018-11-10 10:19:41,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526b064b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:41, skipping insertion in model container [2018-11-10 10:19:41,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:19:41" (1/1) ... [2018-11-10 10:19:41,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:19:41,902 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:19:42,036 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:19:42,041 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:19:42,059 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:19:42,071 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:19:42,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42 WrapperNode [2018-11-10 10:19:42,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:19:42,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:19:42,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:19:42,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:19:42,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... [2018-11-10 10:19:42,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:19:42,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:19:42,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:19:42,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:19:42,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:19:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:19:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:19:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 10:19:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-10 10:19:42,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:19:42,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:19:42,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 10:19:42,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:19:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:19:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 10:19:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:19:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:19:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:19:50,572 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:19:50,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:50 BoogieIcfgContainer [2018-11-10 10:19:50,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:19:50,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:19:50,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:19:50,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:19:50,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:19:41" (1/3) ... [2018-11-10 10:19:50,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c2687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:19:50, skipping insertion in model container [2018-11-10 10:19:50,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:19:42" (2/3) ... [2018-11-10 10:19:50,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c2687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:19:50, skipping insertion in model container [2018-11-10 10:19:50,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:50" (3/3) ... [2018-11-10 10:19:50,579 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-10 10:19:50,586 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:19:50,590 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:19:50,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:19:50,622 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:19:50,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:19:50,623 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:19:50,623 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:19:50,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:19:50,623 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:19:50,623 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:19:50,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:19:50,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:19:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 10:19:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:19:50,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:19:50,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:19:50,639 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:19:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:19:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-10 10:19:50,645 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:19:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 10:19:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:19:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:51,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:19:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:51,820 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:19:51,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:19:51,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:19:51,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:19:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:19:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:19:51,852 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-10 10:19:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:19:51,870 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-10 10:19:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:19:51,871 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 10:19:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:19:51,877 INFO L225 Difference]: With dead ends: 56 [2018-11-10 10:19:51,878 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 10:19:51,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:19:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 10:19:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 10:19:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:19:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-10 10:19:51,903 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-10 10:19:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:19:51,903 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 10:19:51,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:19:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-10 10:19:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:19:51,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:19:51,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:19:51,904 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:19:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:19:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-10 10:19:51,905 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:19:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 10:19:51,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:19:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:53,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:19:59,823 WARN L179 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-10 10:19:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:59,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:19:59,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:19:59,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:19:59,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:19:59,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:19:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:19:59,850 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-10 10:20:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:20:06,772 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-10 10:20:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:20:06,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 10:20:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:20:06,774 INFO L225 Difference]: With dead ends: 49 [2018-11-10 10:20:06,774 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 10:20:06,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:20:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 10:20:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 10:20:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:20:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 10:20:06,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-11-10 10:20:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:20:06,779 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 10:20:06,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:20:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 10:20:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:20:06,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:20:06,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:20:06,780 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:20:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:20:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-11-10 10:20:06,781 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:20:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 10:20:06,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:20:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:20:08,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:20:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:20:08,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:20:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:20:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:20:08,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:20:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:20:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:20:08,606 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-11-10 10:20:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:20:12,313 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-10 10:20:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:20:12,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 10:20:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:20:12,317 INFO L225 Difference]: With dead ends: 63 [2018-11-10 10:20:12,317 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 10:20:12,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:20:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 10:20:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-10 10:20:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:20:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 10:20:12,327 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-11-10 10:20:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:20:12,327 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 10:20:12,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:20:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 10:20:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:20:12,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:20:12,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:20:12,329 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:20:12,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:20:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-11-10 10:20:12,329 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:20:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 10:20:12,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:20:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:20:15,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:20:17,868 WARN L832 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-11-10 10:20:19,982 WARN L854 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-11-10 10:20:22,368 WARN L832 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from false [2018-11-10 10:20:24,766 WARN L854 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from true [2018-11-10 10:20:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 10:20:24,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:20:47,112 WARN L179 SmtUtils]: Spent 22.14 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 10:21:04,307 WARN L179 SmtUtils]: Spent 17.19 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 10:21:29,096 WARN L179 SmtUtils]: Spent 24.79 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 10:21:53,878 WARN L179 SmtUtils]: Spent 24.78 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 10:21:56,311 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-11-10 10:21:58,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-11-10 10:22:01,184 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from false [2018-11-10 10:22:03,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from true [2018-11-10 10:22:06,332 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from false [2018-11-10 10:22:09,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from true [2018-11-10 10:22:11,915 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from false [2018-11-10 10:22:14,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from true [2018-11-10 10:22:17,610 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from false [2018-11-10 10:22:20,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from true [2018-11-10 10:22:22,870 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse3 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) RNE 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-11-10 10:22:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 10:22:22,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:22:22,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-10 10:22:22,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 10:22:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 10:22:22,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-10 10:22:22,934 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-11-10 10:22:25,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= .cse0 c_main_~d~0) (fp.leq .cse1 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2018-11-10 10:22:27,847 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from false [2018-11-10 10:22:30,676 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from true [2018-11-10 10:22:33,105 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from false [2018-11-10 10:22:36,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from true [2018-11-10 10:22:38,466 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from false [2018-11-10 10:22:41,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from true [2018-11-10 10:22:46,443 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from false [2018-11-10 10:22:48,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from true [2018-11-10 10:22:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:22:49,106 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-10 10:22:49,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:22:49,107 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-11-10 10:22:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:22:49,108 INFO L225 Difference]: With dead ends: 55 [2018-11-10 10:22:49,108 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 10:22:49,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=58, Invalid=149, Unknown=23, NotChecked=420, Total=650 [2018-11-10 10:22:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 10:22:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-10 10:22:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 10:22:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 10:22:49,118 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-10 10:22:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:22:49,118 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 10:22:49,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 10:22:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 10:22:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:22:49,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:22:49,119 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:22:49,120 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:22:49,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:22:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 801057869, now seen corresponding path program 1 times [2018-11-10 10:22:49,120 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:22:49,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-10 10:22:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:22:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:22:53,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:22:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:22:53,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:22:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:22:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:22:53,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:22:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:22:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:22:53,255 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-11-10 10:22:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:22:57,100 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-11-10 10:22:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:22:57,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-10 10:22:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:22:57,102 INFO L225 Difference]: With dead ends: 89 [2018-11-10 10:22:57,102 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 10:22:57,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:22:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 10:22:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 10:22:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 10:22:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 10:22:57,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-10 10:22:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:22:57,112 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 10:22:57,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:22:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 10:22:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:22:57,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:22:57,113 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:22:57,113 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:22:57,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:22:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-11-10 10:22:57,114 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:22:57,114 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc5c08e8-4040-4318-a711-7c86eda42c3b/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 10:22:57,117 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:23:02,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:23:02,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:23:02,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:23:04,929 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-11-10 10:23:07,046 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-11-10 10:23:09,415 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from false [2018-11-10 10:23:11,794 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from true [2018-11-10 10:23:14,478 WARN L832 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from false [2018-11-10 10:23:17,145 WARN L854 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from true [2018-11-10 10:23:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-10 10:23:17,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:23:49,786 WARN L179 SmtUtils]: Spent 32.45 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-10 10:23:53,563 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 10:23:53,765 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-11-10 10:23:53,765 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.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeSummaryForInterproceduralTrace(IterativePredicateTransformer.java:563) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeProcedureSummary(IterativePredicateTransformer.java:483) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: 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) ... 46 more [2018-11-10 10:23:53,767 INFO L168 Benchmark]: Toolchain (without parser) took 251897.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 950.8 MB in the beginning and 937.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 169.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:23:53,768 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:23:53,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:23:53,768 INFO L168 Benchmark]: Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:23:53,769 INFO L168 Benchmark]: RCFGBuilder took 8471.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:23:53,769 INFO L168 Benchmark]: TraceAbstraction took 243193.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.7 MB in the end (delta: 189.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:23:53,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8471.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 243193.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.7 MB in the end (delta: 189.1 MB). Peak memory consumption was 189.1 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...